1A-Theatre_Square
leenickzh Lv4
  • 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 <= ${10^9}).

Output

Write the needed number of flagstones.

Examples

1
6 6 4
1
4

Notice

in this problem, you should pay attention to define the variables m, n and a. i use ‘int’ in my first submit. it note me “Wrong answer on test 9”, because when you input 999999999 999999999 1, the number can’t be solved. then i change the ‘int’ to ‘unsigned long long’ and it told me ‘Accepted’.

My Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include <stdio.h>

int main()
{
unsigned long long m,n,a;
scanf("%llu%llu%llu",&m,&n,&a);
unsigned long long needed;
unsigned long long i,j;
if(m%a==0) i=m/a;
else i=m/a+1;
if(n%a==0) j=n/a;
else j=n/a+1;
needed=i*j;
printf("%llu",needed);
return 0;
}
  • Post title:1A-Theatre_Square
  • Post author:leenickzh
  • Create time:2021-09-10 23:00:27
  • Post link:https://nickk.cn/2021/09/10/1A-Theatre-Square/
  • Copyright Notice:All articles in this blog are licensed under BY-NC-SA unless stating additionally.
 Comments