| Task: | Pussit |
| Sender: | |
| Submission time: | 2015-08-15 23:37:33 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1 | details |
| #2 | WRONG ANSWER | 0.05 s | 2 | details |
| #3 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
void solve(LL n, LL m, LL k){
LL x2 = m % n; // # bags with floor(m/n) + 1 balls
LL x1 = n - x2; // # bags with floor(m/n) balls
LL d = m/n;
//cout << "n m k " << n << " " << m << " " << k << endl;
//cout << "x1 x2 d " << x1 << " " << x2 << " " << d << endl;
if(k <= d * x1){
LL full_bags_needed = k / d;
LL misses = full_bags_needed;
if(k % d == 0) misses--;
cout << misses + k << endl;
}
else{
LL misses = x1;
LL k2 = k - d*x1;
LL full_bags_needed = k2 / (d+1);
misses += full_bags_needed;
if(k2 % (d+1) == 0) misses--;
cout << misses + k << endl;
}
}
int main(){
LL cases; cin >> cases;
while(cases--){
LL n,m,k;
cin >> n >> m >> k;
solve(n,m,k);
}
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 1000 11 16 2 5 16 15 2 14 14 9 11 1 ... |
| correct output |
|---|
| 2 15 14 1 1 ... |
| user output |
|---|
| 3 19 15 1 1 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1436 3023 1378 4419 4559 3881 115 4220 1440 3556 3152 1653 ... |
| correct output |
|---|
| 1378 3881 1440 2057 5312 ... |
| user output |
|---|
| 2066 7761 1479 3709 7132 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 337723917 939459738 544279388 233319567 486500388 164139442 722536320 995223331 969580610 274242146 994174001 844564432 ... |
| correct output |
|---|
| 544279388 164139442 1194505265 870263078 547470112 ... |
| user output |
|---|
| 750276521 246209162 1679295569 1081404185 921316098 ... |
