http://codeforces.com/problemset/problem/1/A
2 seconds
64 megabytes
standard input
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.
The input contains three positive integer numbers in the first line: n, m and a (1 ≤ n, m, a ≤ 109).
Write the needed number of flagstones.
6 6 4
4
看懂题意，注意一点就行了，就是不能有没有覆盖的地方，求用的最少砖的数量
#include<iostream>
#include<cstdio> using namespace std; int main()
{
__int64 m,n,a,sum,x,y;
while(scanf("%I64d%I64d%I64d",&n,&m,&a)!=EOF)
{
if(n%a == 0)
{
x = n/a;
}
else
{
x = n/a+1;
}
if(m%a == 0)
{
y = m/a;
}
else
{
y = m/a+1;
}
// printf("%I64d %I64d\n",x,y);
sum = x*y;
printf("%I64d\n",sum);
} return 0;
}