Codeforces Beta Round #1 Theatre Square

最新推荐文章于 2022-07-28 16:33:21 发布

围巾的ACM

最新推荐文章于 2022-07-28 16:33:21 发布

阅读量335

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51511516

水题专栏收录该内容

159 篇文章

订阅专栏

本文介绍了一种简单的方法来计算给定尺寸的矩形区域所需的最小数量的正方形砖块。这种方法适用于解决类似剧院广场铺装的问题，确保砖块完全覆盖指定区域且不被破坏。

思路：水题，n/a*m/a即可，注意向上取整

#include<bits\stdc++.h>
using namespace std;
#define LL long long
int main()
{
     LL n,m,a;
	 cin >> n >> m >> a;
	 LL ans =ceil(n/(double)a)*ceil(m/(double)a);
	 cout << ans << endl;
}

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.