A. Theatre Square(math)

本文探讨了Theatre Square铺砖问题,这是一个经典的数学问题,需要确定覆盖特定尺寸广场所需的最少方砖数量。输入包括广场的长宽及方砖尺寸。

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

A. Theatre Square
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
input
6 6 4
output
4

 

水题但是错了n次,归其原因还是对C语言不太熟悉,很多东西我还都不知道——int64,什么时候用这个,真的不太了解,未来的路还很长,加油

 

AC代码

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

int main()
{
    __int64 n,m,a;
    __int64 L,W;

    scanf("%I64d%I64d%I64d",&n,&m,&a);
    if( n%a == 0 )
        L = n/a;
    else
        L = n/a + 1;

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

    printf("%I64d\n", W*L);

    return 0;
}
View Code

 

 

 

 

转载于:https://www.cnblogs.com/ruruozhenhao/p/7918417.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值