1A

最新推荐文章于 2021-05-26 22:53:54 发布

原创最新推荐文章于 2021-05-26 22:53:54 发布 · 555 阅读

0 ·

CC 4.0 BY-SA版权

codefoces 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个关于在剧院广场上使用特定尺寸的方形砖块进行铺设的问题，旨在找到最少需要多少块砖才能完全覆盖广场的方法。文章提供了输入输出示例及代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 sizen × mmeters. 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 sizea × 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, mand a(1 ≤ n, m, a ≤ 10⁹).

Output

Write the needed number of flagstones.

Sample test(s)

input

6 6 4

output

WA 在精度溢出：

Test: #16, time: 15 ms., memory: 0 KB, exit code: 0, checker exit code: 1, verdict: WRONG_ANSWER

Input
1000000000 1000000000 192
Output
-270385980
Answer
27126743055556
Checker Log
wrong answer 1st numbers differ - expected: '27126743055556', found: '-270385980'
 
 
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
   // freopen("in.txt","r",stdin);

    int n,m,a;

    while(~scanf("%d%d%d",&m,&n,&a))
    {
        int l=(m+a-1)/a;
        int w = (n+a-1)/a;
        printf("%d\n",l*w);
    }
    return 0;
}