Task: | Pussit |
Sender: | |
Submission time: | 2015-08-21 12:57:05 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 17 |
#2 | ACCEPTED | 49 |
#3 | ACCEPTED | 34 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 2 | details |
#3 | ACCEPTED | 0.05 s | 3 | details |
Code
#include <iostream> using namespace std; int main() { int t; cin>>t; for(int xx = 0; xx < t; ++xx) { int n,m,k; cin>>n>>m>>k; if((m/n)*n >= k) { cout<<k<<'\n'; continue; } int lo = 0; int hi = n; int best = n; while(lo <= hi) { int mid = (lo+hi)/2; int q = n - mid; int h = (m / q); if(h == 0) { lo = mid+1; continue; } //toimiiko jos m -> k //if(mid*(h-1) >= m - h*q) { if(mid*(h) >= k - h*q) { best = mid; hi = mid-1; } else { lo = mid+1; } } cout<<best+k<<'\n'; } }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
1000 11 16 2 5 16 15 2 14 14 9 11 1 ... |
correct output |
---|
2 15 14 1 1 ... |
user output |
---|
2 15 14 1 1 ... |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
1000 1436 3023 1378 4419 4559 3881 115 4220 1440 3556 3152 1653 ... |
correct output |
---|
1378 3881 1440 2057 5312 ... |
user output |
---|
1378 3881 1440 2057 5312 ... |
Test 3
Group: 3
Verdict: ACCEPTED
input |
---|
1000 337723917 939459738 544279388 233319567 486500388 164139442 722536320 995223331 969580610 274242146 994174001 844564432 ... |
correct output |
---|
544279388 164139442 1194505265 870263078 547470112 ... |
user output |
---|
544279388 164139442 1194505265 870263078 547470112 ... |