[UVA][GCD] 10673 - Play with Floor and Ceil
Problem APlay with Floor and Ceil
Input:
standard inputOutput:
standard outputTime Limit:
1 second
Theorem
For any two integers x and k there exists two more integers p and q such that:
It’s a fairly easy task to prove
this theorem, so we’d not ask ...
