Theatre Square

Codeforces 1A. 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 <stdio.h>
int main() {
    long long m, n, a;
    scanf("%lld %lld %lld", &m, &n, &a);
    long long b = m % a ? m / a + 1 : m / a;
    long long c = n % a ? n / a + 1 : n / a;
    printf("%lld\n", b * c);
    return 0;
}

  日常从水题开始