Codeforces 1A (A. Theatre Square) Simple math problem

Codeforces 1A (A. Theatre Square) Simple math problem

A. Theatre Square

time limit per test

2 seconds

memory limit per test

64 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 ≤ 10⁹).

Output

Write the needed number of flagstones.

Sample test(s)

Input

6 6 4

Output

4

//  注意一下格式控制的问题就好！

<span style="font-size:18px;">// codeforces 第一题！ 
#include<iostream>
#include<cmath>
#include<iomanip>
#include<iostream>
using namespace std;

int main()
{
	double n,m,a;
	cin>>n>>m>>a;
	// 重点就是关于precision的使用，还有fixed（定点格式输出）的使用。
	// ceil函数本身的返回值就是double型的，所以用了setprecision。 
	cout<<fixed<<setprecision(0)<<ceil(n/a)*ceil(m/a)<<endl;
	return 0;
}</span>