A - Theatre Square

最新推荐文章于 2025-10-05 17:03:17 发布

原创最新推荐文章于 2025-10-05 17:03:17 发布 · 721 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM

ACM训练赛1 专栏收录该内容

4 篇文章

订阅专栏

本文探讨了如何使用固定大小的正方形砖块铺设矩形广场的问题，旨在找到最少所需的砖块数量。通过使用数学中的向上取整函数，解决了长和宽方向上砖块的数量问题。

Description

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 Input
Input

6 6 4

Output

水题，用小正方形填充长方形，主要就是求出长和宽各需要正方形边长倍数，注意用ceil函数求上限。
代码如下：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
    int m,n,a;
    int n1,n2;
    while(scanf("%d%d%d",&m,&n,&a) != EOF)
    {
        n1 = (int)ceil(m/(double)a);
        n2 = (int)ceil(n/(double)a);
        printf("%I64d\n", (long long)n1*n2);
    }
    return 0;
}