CodeForces 1A Theatre Square

A - Theatre Square

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 1A

Description

Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.

What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.

Input

The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 10⁹).

Output

Write the needed number of flagstones.

Sample Input

Input

6 6 4

Output

4


主要是注意数据范围和进一法取近似值。

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    long int n,m,a;
    while(~scanf("%ld%ld%ld",&n,&m,&a))
    {
        long long int r;
        r=(n%a==0)?n/a:n/a+1;
        long long int c;
        c=(m%a==0)?m/a:m/a+1;
        printf("%I64d\n",r*c);
    }
    return 0;
}