A-Problem-A

A-Problem-A
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。
铺砌广场所需的石板最少是多少？它允许覆盖面积大于剧院广场的表面，但广场必须被覆盖。I它不允许打破石板。石板的侧面应该与正方形的侧面平行。
输入
输入包含第一行中的三个正整数：N,M和a（1≤N,M,a≤109）。
产出
写下需要的石板数。
例子
输入
6 6 4
产出
4
问题分析：长方形的长N和宽M分别除以石板的边长a,如果可以不可以整除，得到的结果加一，否则不加。然后两个结果相乘，即为所需的最少石板数。
C++程序代码：

#include <iostream>
using namespace std;int main()
{__int64 m, n, a,j,k,s;cin >> m >> n >> a;if (n >= 1){if (m%a == 0 && n%a == 0){j = m / a;k = n / a;s = j * k;cout << s;}if (m%a == 0 && n%a != 0){j = m / a;k = n / a + 1;s = j * k;cout << s;}if (m%a != 0 && n%a == 0){j = m / a + 1;k = n / a;s = j * k;cout << s;}if (m%a != 0 && n%a != 0){j = m / a + 1;k = n / a + 1;s = j * k;cout << s;}}
}

A-Problem-A相关推荐

linux下yum错误：[Errno 14] problem making ssl connection Trying other mirror.
所有的base 都要取消注释 mirrorlist 加上注释另外所有的enable都要设为零目录今天是要yum命令安装EPEL仓库后 yum install epel-release 突然发现y ...
A + B Problem
1001: A + B Problem Description 计算 A + B. Input 多组测试数据,每组测试数据占一行,包括2个整数. Output 在一行中输出结果. Sample Inp ...
Error:(49, 1) A problem occurred evaluating project ':guideview'. Could not read script 'https://r
出现问题如下: Error:(49, 1) A problem occurred evaluating project ':guideview'. > Could not read script ...
#418 Div2 Problem B An express train to reveries (构造 || 全排列序列特性)
题目链接:http://codeforces.com/contest/814/problem/B 题意 : 有一个给出两个含有 n 个数的序列 a 和 b, 这两个序列和(1~n)的其中一个全排列序列 ...
ADPRL - 近似动态规划和强化学习 - Note 3 - Stochastic Infinite Horizon Problem
Stochastic Infinite Horizon Problem 3.Stochastic Infinite Horizon Problem 定义3.1 无限范围的马尔可夫决策过程 (Marko ...
ADPRL - 近似动态规划和强化学习 - Note 2 - Stochastic Finite Horizon Problem
2. Stochastic Finite Horizon Problem 在这一节中主要介绍了随机DP算法来解决不确定性下的有限地范围问题,如Denition 1.4所述,它被表述为一个组合优化问题. ...
There was a problem confirming the ssl certificate ……
在安装一个Python库onetimepass时发生下面的问题: pip install onetimepass Could not fetch URL https://pypi.python.org ...
HDU 1757 A Simple Math Problem
Problem Description Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x & ...
The C10K problem原文翻译
原文地址:http://www.cnblogs.com/fll/archive/2008/05/17/1201540.html The C10K problem 如今的web服务器需要同时处理一万个以 ...
This is probably not a problem with npm. There is likely additional logging output above
微信小程序开发交流qq群 173683895 承接微信小程序开发.扫码加微信. E:\weii_objct\invoice-manage-web-view>npm start > ...

A-Problem-A

A-Problem-A相关推荐

最新文章

热门文章