CodeForces 1A Theatre Square(模拟+简单数学)

Theatre Square

Time Limit: 2000ms

Memory Limit: 65536KB

This problem will be judged on  CodeForces. Original ID:  1A
64-bit integer IO format:  %I64d      Java class name:  (Any)

Prev 

Submit  Status  Statistics  Discuss

  Next

Type: 

None

  None Graph Theory      2-SAT     Articulation/Bridge/Biconnected Component      Cycles/Topological Sorting/Strongly Connected Component      Shortest Path          Bellman Ford         Dijkstra/Floyd Warshall      Euler Trail/Circuit      Heavy-Light Decomposition     Minimum Spanning Tree      Stable Marriage Problem      Trees     Directed Minimum Spanning Tree      Flow/Matching          Graph Matching             Bipartite Matching              Hopcroft–Karp Bipartite Matching              Weighted Bipartite Matching/Hungarian Algorithm          Flow              Max Flow/Min Cut             Min Cost Max Flow  DFS-like      Backtracking with Pruning/Branch and Bound      Basic Recursion     IDA* Search      Parsing/Grammar     Breadth First Search/Depth First Search      Advanced Search Techniques          Binary Search/Bisection         Ternary Search  Geometry      Basic Geometry     Computational Geometry      Convex Hull      Pick's Theorem Game Theory      Green Hackenbush/Colon Principle/Fusion Principle      Nim     Sprague-Grundy Number  Matrix     Gaussian Elimination      Matrix Exponentiation Data Structures      Basic Data Structures     Binary Indexed Tree      Binary Search Tree      Hashing     Orthogonal Range Search      Range Minimum Query/Lowest Common Ancestor      Segment Tree/Interval Tree     Trie Tree      Sorting      Disjoint Set String      Aho Corasick     Knuth-Morris-Pratt      Suffix Array/Suffix Tree Math      Basic Math     Big Integer Arithmetic      Number Theory         Chinese Remainder Theorem          Extended Euclid          Inclusion/Exclusion         Modular Arithmetic      Combinatorics          Group Theory/Burnside's lemma         Counting      Probability/Expected Value  Others     Tricky      Hardest     Unusual      Brute Force     Implementation      Constructive Algorithms     Two Pointer      Bitmask     Beginner      Discrete Logarithm/Shank's Baby-step Giant-step Algorithm      Greedy     Divide and Conquer  Dynamic Programming                   Tag it!

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.

Sample Input

Input

6 6 4

Output

4

Source

Codeforces Beta Round #

题目大意:有一个m*n的广场,现在要在上面铺满a*a的石板,石板不能分割,问至少需要多少石板.

简单的模拟.可以直接模拟,也可以用ceil()函数,向上取整,ceil(2.1)=3,ceil(2.0)=2

AC代码:

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
    __int64 m,n,a;
    while(cin>>m>>n>>a)
    {
        __int64 x=ceil(1.0*m/a);
        __int64 y=ceil(1.0*n/a);
        /**
        __int64 x=m/a;
        if(m%a) x+=1;
        __int64 y=n/a;
        if(n%a) y+=1;
        */
        cout<<x*y<<endl;
    }
    return 0;
}