CF#1A. Theatre Square

原创于 2014-11-06 14:35:50 发布 · 676 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

Codeforces 专栏收录该内容

6 篇文章

订阅专栏

本文探讨了Theatre Square铺砖问题，这是一个经典的数学问题，需要确定最少数量的边长为a的正方形砖块，以完全覆盖一个大小为n×m的矩形区域。

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.

Sample test(s)

input
6 6 4

output
4

原题大意：

地面是一个n*m的矩形，用边长为a的正方形至少要几块才能铺满。

恩大致就是这个意思，推一推就能推出规律来啦～～

CODE:

#include<cstdio>
using namespace std;
int main()
{
	unsigned long long n,m,a,l,w;
	scanf("%I64u%I64u%I64u",&n,&m,&a);
	if(n<a||m<a)
	{
		printf("1\n");
	}
	else
	{
	if(n%a!=0)
	{
		l=n/a+1;
	}
	else
	{
		l=n/a;
	}
	if(m%a!=0)
	{
		w=m/a+1;
	}
	else
	{
		w=m/a;
	}
	printf("%I64u\n",l*w);
   }
	return 0;
}