zoukankan      html  css  js  c++  java
  • 1A -- Theatre Square

    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


    # include <iostream>
    using namespace std;
    typedef long long int ll;
    int main()
    {
    	
    	ll n, m, a;
    	while(cin >> n >> m >> a)
    	{
    		if(!(n % a))
    			n = n / a;
    		else
    			n = n / a + 1;
    		if(!(m % a))
    			m = m / a;
    		else
    			m = m / a + 1;
    		cout << n * m << endl;
    	}
    	
    	return 0;
    }
    
    生命不息,奋斗不止,这才叫青春,青春就是拥有热情相信未来。
  • 相关阅读:
    C语言-const和volatile深度分析
    C语言循环语句工程用法
    C分支语句的工程用法
    函数对象分析
    关于protel电路图导入word
    单片机程序编写与下载
    关于Protel输出PDF原理图
    关于定时器、外部中断的一些理解
    锁存、译码介绍
    关于Proteus电压设置
  • 原文地址:https://www.cnblogs.com/lyf-acm/p/5784533.html
Copyright © 2011-2022 走看看