Codeforces 1A A. Theatre Square （3.18）

最新推荐文章于 2023-11-03 20:42:27 发布

原创最新推荐文章于 2023-11-03 20:42:27 发布 · 637 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 专栏收录该内容

1 篇文章

订阅专栏

本文介绍 CodeForces 平台上的 Theatre Square 问题 (1A) 的解决思路与代码实现。该问题要求计算使用 a×a 大小的花岗岩砖铺满 n×m 大小的矩形广场所需的最小砖块数量。

题目地址：http://codeforces.com/problemset/problem/1/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*a 的花岗岩石板铺设，允许石板之间覆盖，不允许打破，求最少所需的石板数。

只需要长与宽分别除a取上整数即可。PS：需要用long long 才可以过。

#include <iostream>
using namespace std;
int main()
{
    int n,m,a;
    while(cin>>n>>m>>a)
    {
        long long sum,x,y;
        if(n%a==0) x=n/a;
        else x=n/a+1;
        if(m%a==0) y=m/a;
        else y=m/a+1;
        sum=x*y;
        cout<<sum<<endl;
    }
    return 0;
}

结果：