[codeforces] A. Theatre Square

problem

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.

 

using language : python3 

 

from math import ceil
n,m,a = list(map(int,input().split()))
 
num1 = ceil(n/a)
num2 = ceil(m/a)
print(int(num1*num2))