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≤109).

Output

Write the needed number of flagstones.

Sample Input

6 6 4

4

Source

题目大意:有一个m*n的广场,现在要在上面铺满a*a的石板,石板不能分割,问至少需要多少石板.

简单的模拟.可以直接模拟,也可以用ceil()函数,向上取整,ceil(2.1)=3,ceil(2.0)=2

AC代码:

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
    __int64 m,n,a;
    while(cin>>m>>n>>a)
    {
        __int64 x=ceil(1.0*m/a);
        __int64 y=ceil(1.0*n/a);
        /**
        __int64 x=m/a;
        if(m%a) x+=1;
        __int64 y=n/a;
        if(n%a) y+=1;
        */
        cout<<x*y<<endl;
    }
    return 0;
}

顶

0

踩

0