CodeForces - 1A - Theatre Square

CodeForces - 1A - Theatre Square

---

题目

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

6 6 4

Output

4

题意

长方形，大小为nm米。决定用方形的花岗岩石板铺广场。每块石板的大小为aa。铺广场至少需要多少块石板?它可以覆盖比剧院广场大的表面，但广场必须被覆盖。不允许打破石板。石板的边沿应与广场的边沿平行。

思路

水题 照题意模拟即可

坑点

注意数据范围10的9次方，爆int了，以及必须全部覆盖到

代码

#include<bits/stdc++.h>
using namespace std;
int main()
{

	long long int n,m,a;
	while(scanf("%lld%lld%lld",&n,&m,&a)!=EOF)
	{
		if((n)%(a)!=0)
		{
			n=(n)/(a)+1;
		}
		else
		{
			n=(n)/(a);
		}
		
		if((m)%(a)!=0)
		{
			m=(m)/(a)+1;
		}
		else
		{
			m=(m)/(a);
		}
		long long int ans=n*m;
		printf("%lld",ans);
	}	
	return 0;
	
}