PS [04] | Theatre Square Codeforces Solution using C++ - شرح بالعربي
Problem Link: https://codeforces.com/problemset/pro...
(A. Theatre Square)
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.
=============================
📺 Playlist Link: • Problem Solving (Leetcode and Codefor...
👤 Connect with me on LinkedIn: / abdallafadl
Watch video PS [04] | Theatre Square Codeforces Solution using C++ - شرح بالعربي online without registration, duration hours minute second in high quality. This video was added by user Abdalla Fadl 01 January 1970, don't forget to share it with your friends and acquaintances, it has been viewed on our site 310 once and liked it 11 people.