| Task: | Pussit |
| Sender: | |
| Submission time: | 2015-08-16 20:10:33 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.06 s | 1 | details |
| #2 | WRONG ANSWER | 0.05 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
using namespace std;
int t;
int n,m,k,l;
int ala, yla, keski;
int onnistuu(int apu) {
if (m-(m%(n-apu)) >= k) return 1;
return 0;
}
int main() {
cin >> t;
for (int i=0;i<t;i++) {
cin >> n >> m >> k;
for (int j=0;j<n;j++) {
ala = m/(n-j);
if (ala*(n-j) >= k) {
cout << k+j << "\n";
break;
}
}
// yla = n-1;
// ala = 0;
// while (yla > ala) {
// keski = (ala+yla)/2;
// if (onnistuu(keski)) yla = keski;
// else ala = keski+1;
// }
// cout << k+ala << "\n";
}
}
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 |
|---|
| 2 15 14 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 |
|---|
| 1378 3881 1440 2057 5312 ... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 337723917 939459738 544279388 233319567 486500388 164139442 722536320 995223331 969580610 274242146 994174001 844564432 ... |
| correct output |
|---|
| 544279388 164139442 1194505265 870263078 547470112 ... |
| user output |
|---|
| (empty) |
