Theatre Square

最新推荐文章于 2024-02-13 15:01:03 发布

原创最新推荐文章于 2024-02-13 15:01:03 发布 · 360 阅读

1 ·

CC 4.0 BY-SA版权

各种比赛专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个关于如何使用最少数量的正方形石砖来铺设一个矩形形状的剧院广场的问题。给出了具体的输入输出示例，并提供了一段C语言代码实现解决方案。

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

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 ≤ 10⁹).

Output

Write the needed number of flagstones.

Example

Input

6 6 4

Output

【题解】：分别用n和m去除以a，若能整除则为整除结果，若不能整数则将商+1，最后所得两个数相乘则为结果。

#include<stdio.h>
int main()

{
    long long int n,m,a,c;
   long long int x,y;
    int k;
    while(scanf("%lld%lld%lld",&n,&m,&a)!=EOF)
    {

            if(n%a==0) x=n/a; else
                x=n/a+1;

            if(m%a==0)
                y=m/a;
            else
                y=m/a+1;

            c=x*y;

            printf("%lld\n",c);

    }
    return 0;
}