1.A. Theatre Square

 

A. Theatre Square

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

Copy

6 6 4

output

4

 

 

题意：用边长为a的正方形铺n*m的矩形，全铺满且正方形不能被破坏。问能铺多少块正方形。

第一次卡在text9上了，给n、m、a定义为long long就好了。

 

代码：

#include
using namespace std;

int main()
{
    long long n,m,a;
    long long sum;
    cin>>n>>m>>a;
    if(n%a==0)
        n=n/a;
    else
        n=n/a+1;
    if(m%a==0)
        m=m/a;
    else
        m=m/a+1;
    sum=n*m;
    cout<