A. Theatre Square

A. Theatre Square

time limit per test

2 seconds

memory limit per test

64 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.

Sample test(s)

input

6 6 4

output

4

这道题大概的意思：

    一个有n×m大小的区域需要铺石板，石板是边长为a的正方形，石板必须和边平行放，可以铺到区域外面，输入n，m，a，求石板数。

这道题是一道简单题，唯一需要注意的一点是数据大小，极端情况，n=m=109，a=1的时候超过了int，需要使用long long。

以下为解题代码：

#include <iostream>
using namespace std;
int main(){
    long long n,m,a;
    cin>>n>>m>>a;
    cout<<((n/a)+(n%a==0?0:1))*((m/a)+(m%a==0?0:1))<<endl;
}