A. Theatre Square
http://codeforces.com/problemset/problem/1/A
time limit per test
memory limit per test
input
output
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
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
1. OJ上第一题就这么一遍编译提交水过了。。
2. customtest，嗯，很好很强大。
3. 如果石板的尺寸是a*b呢？
完整代码：
/*0ms,0KB*/
#include<cstdio>
int main(void)
{
int n, m, a;
scanf("%d%d%d", &n, &m, &a);
int x = n / a, y = m / a;
if (n % a)
++x;
if (m % a)
++y;
printf("%I64d", (__int64)x * y);
return 0;
}
