codeforces-1A-Theatre Square( 测试一下cf平台，囧 )

原创于 2016-02-29 16:18:59 发布 · 620 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #算法 #C++

水题AC记同时被 2 个专栏收录

206 篇文章

订阅专栏

codeforces

12 篇文章

订阅专栏

为了庆祝首都Berland的周年纪念，决定用正方形的花岗岩旗石铺满长为n，宽为m的矩形剧院广场。每个旗石边长为a。求最小需要多少块旗石来铺设？旗石可以超出广场范围，但必须覆盖整个广场，且不能切割旗石。输入包含三个正整数n, m, a (1 ≤ n, m, a ≤ 109)，输出所需旗石的数量。" 114141844,10537181,Java HashMap 并发问题分析：多线程下的CPU飙升,"['Java', '并发编程', 'HashMap', '性能调优', '多线程安全']

摘要生成于 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 ≤ 109).

Output

Write the needed number of flagstones.

Examples

input
6 6 4

output
4
题意：在一个n*m的矩形上用a*a的正方形,平行的完全覆盖，允许重叠，不能裁剪。#include<iostream>
#include<cstdio>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
    double n,m,a;
    cin>>n>>m>>a;
    cout<<fixed<<setprecision(0)<<ceil(n/a)*ceil(m/a)<<endl;
    return 0;
}