zoukankan      html  css  js  c++  java
  • Codeforces 1A

    题目: 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/a]+1个和[m/a]+1个;

    代码:

    #include<iostream>
    #include<cmath>
    using namespace std;
    int main(){
    	double n,m,a;
    	scanf("%lf%lf%lf",&n,&m,&a);
    	printf("%.0f",ceil(n/a)*ceil(m/a));
    	return 0;
    }
    
  • 相关阅读:
    第二周总结
    2019春总结作业
    第二次编程总结
    第四周作业
    第十二周作业
    第十一周作业
    第十周作业
    第九周作业
    第八周作业
    第六周作业
  • 原文地址:https://www.cnblogs.com/yuhan-blog/p/12308988.html
Copyright © 2011-2022 走看看