time limit per test: 0.25 sec. memory limit per test: 65536 KB
input: standard output: standard
A new cemetery is going to be built in Petrozavodsk. It will look like qxc rectangle. You have to determine how many rectangular nx1 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.
Test #1 4 5 3
Test #2 100000000000000000000000000000 100000000000000000000000000000 100000000000000000000000000001
Test #1 6
Test #2 0
Anton Golubev, Petrazavodsk SU
Anton Golubev (Hedgehog)'s Contest #2 from Annual Summer Russian Teams Meeting in Petrozavodsk State University
August 26, 2005
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov