292. Field for the Cemetery
time limit per test: 0.25
memory limit per test: 65536
A new cemetery is going to be built in Petrozavodsk. It will look like qx
c rectangle. You have to determine how many rectangular nx
1 graves can be placed there. Graves may only be placed parallel to the sides of cemetery.
There will be exactly three lines in the input, each containing one integer: q, c, and n (0 <= q,c <= 10^1000, 1 <= n <= 10^1000).
Output a single number --- maximal number of graves.
|Author:||Anton Golubev, Petrazavodsk SU
|Resource:||Anton Golubev (Hedgehog)'s Contest #2 from Annual Summer Russian Teams Meeting in Petrozavodsk State University
|Date:||August 26, 2005
|Server time: 2017-09-26 22:18:01||Online Contester Team © 2002 - 2016. All rights reserved.|