1A. Theatre Square

**

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

问题概述：多少a×a的石块才能保证铺满m×n的广场。输入为n,m,a。输出为石块数。

#include<iostream>
#include<math.h>
using namespace std;

int main()
{
	double a,b,c;//分别为n,m,a 
	long long ans;//因为输出值大于int上限，使用longlong型 
	cin>>a>>b>>c;//接受n,m,a 
	ans=ceil(a/c)*ceil(b/c);//答案应该是n/a向上取整与m/a向上取整的乘积 
	cout<<ans<<endl;//输出答案 
	return 0;
}

出现过的错误：ans设置成int型，超出了int上限。