cf #1 A. Theatre Square

最新推荐文章于 2022-06-13 11:03:06 发布

猿的进化之路

最新推荐文章于 2022-06-13 11:03:06 发布

阅读量283

点赞数

分类专栏： *******数学********

本文链接：https://blog.csdn.net/yuanjunlai141/article/details/49561901

版权

*******数学******** 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

本文解析了CodeForces竞赛平台上的A级题目——Theatre Square。该题要求计算使用特定尺寸的地砖覆盖一个给定大小矩形广场所需的最少地砖数量。文中提供了一个简洁的C++代码示例，用于解决此问题。

摘要由CSDN通过智能技术生成

http://codeforces.com/contest/1/problem/A

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，不可以毁坏地砖，问最少需要多少块

#include <iostream>

using namespace std;

int main()
{
    long long  n,m,a;
    while(cin>>n>>m>>a)
    {
        if(n%a==0)
            n=n/a;
        else
            n=n/a+1;
        if(m%a==0)
            m=m/a;
        else
            m=m/a+1;
        cout<<n*m<<endl;
    }
    return 0;
}