w96得到了一张n*n的海报,ta想把它贴在墙上.w96有一个宽度为1的双面胶,双面胶的总长度为l.w96有强迫症,每次会取长度恰好为k的双面胶贴在海报背面双面胶的边要与海报对应的边平行,并且双面胶不能贴出海报边缘也不能相互覆盖.w96希望海报背面未贴上双面胶的面积最小
Problem G: 贴海报
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 95 Solved: 4
[Submit][Status][Web Board]
Description
Input
第一行一个正整数T,代表有T组数据
每组数据一行,分别为三个正整数n,k,l(1<=n, k <= 1e9, 1 <= l <= 1e18)
Output
对每组数据输出一个正整数s,代表未贴上双面胶的面积的最小值
Sample Input
2
1 1 1
3 2 10
Sample Output
0
1
HINT
한국어
中文
فارسی
English
ไทย
Anything about the Problems, Please Contact Admin:admin
All Copyright Reserved 2010-2013 ZJUT ONLINE JUDGE TEAM
GPL2.0 2003-2013 HUSTOJ Project TEAM
Anything about the Problems, Please Contact Admin:admin
All Copyright Reserved 2010-2013 ZJUT ONLINE JUDGE TEAM
GPL2.0 2003-2013 HUSTOJ Project TEAM