哇咔咔,终于到了实现梦想的时刻。
CF红名我来了,你别跑。
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
6 6 4
Output
4
翻译:
过年了,他们家要翻新,他家的面积是n*m的,用a*a的地板铺。
家里有钱,每一块地板都不能掰开用,可以铺的大点。问最少需要多少地瓷砖。、
code:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
#define ll long long
int main()
{
ll n,m,a;
while(scanf("%lld%lld%lld",&n,&m,&a)!=EOF)
{
ll x=(n%a)?(n/a+1):(n/a);
ll y=(m%a)?(m/a+1):(m/a);
printf("%lld\n",x*y);
}
return 0;
}