CARE CENTRE SQUARE EXERCISES

• Problem Description

  
  Theatre Square in the capital city of Berland has a rectangular shape with the size nm 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 aa.
  
  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.

• CODING ARENA

• #include <stdio.h>

  int main() {

  int n,m,a;

  scanf("%d %d %d", &n, &m, &a);

  printf("%d", (n+a-1)/a*((m+a-1)/a));

  return 0;

  }

• Test Case 1

  
  Input (stdin)

  6 6 4
  
  

  Expected Output

  4

• Test Case 2

  
  Input (stdin)

  12 13 4
  
  

  Expected Output

  12