Codeforces #1A: Theatre Square

You can find this in: http://codeforces.com/problemset/problem/1/A

My solution: https://github.com/masphei/ProblemSolver/tree/master/Square

Theatre Square
time limit per test2 seconds
memory limit per test64 megabytes
inputstandard input
outputstandard 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.

Sample test(s)
input
6 6 4
output
4

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s