【codeforces 1A】Theatre Square——数学，水

最新推荐文章于 2022-08-06 22:12:46 发布

原创最新推荐文章于 2022-08-06 22:12:46 发布 · 812 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数学 #codeforces

题解心得同时被 3 个专栏收录

63 篇文章

订阅专栏

水题

7 篇文章

订阅专栏

codeforces

2 篇文章

订阅专栏

本文介绍如何计算覆盖矩形剧场广场所需的最小正方形方砖数量，允许方砖超出广场面积但必须完全覆盖广场。通过输入广场尺寸和方砖尺寸，输出所需方砖总数。

题目：

Theatre Square in the capital city of Berland has a rectangular shape with the size n × 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 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.

Examples

input
6 6 4

output
4

描述：给定一个n*m的矩形，要求用a*a的正方形块实现全覆盖，可以超出矩形的面积

题解：看矩形的两条边分别需要多少a才能全覆盖。

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int a;
    scanf("%d",&a);
    __int64 l,r;
    l = (n % a == 0) ? n / a : n / a + 1;
    r = (m % a == 0) ? m / a : m / a + 1;
    printf("%I64d\n",l * r);
    return 0;
}