http://codeforces.com/contest/1/problem/A
分析:
给你矩形的两条边长,以及小正方形的边长,让你算至少需要多少的小正方形才能把矩形填满。(超出不要紧)
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>
typedef long long LL;
const double pi = acos(-1.0);
const long long mod = 1e9 + 7;
using namespace std;
int main()
{
//freopen("int.txt","r",stdin);
//freopen("out.txt","w",stdout);
LL N,M,A;
while(scanf("%I64d %I64d %I64d",&N,&M,&A) != EOF)
{
LL ans = ceil(N * 1.0 / A) * ceil(M * 1.0 / A);
printf("%I64d\n",ans);
}
return 0;
}