| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 170320 |
2019-12-24T19:57:50 Z |
ngmh |
Go (COCI16_go) |
C++11 |
|
2 ms |
408 KB |
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> pi;
long long n, a[70], b[70], t, m, p = 80, l;
string c[70];
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> c[i] >> a[i] >> b[i];
t = 0;
if(a[i] > b[i]) continue;
while(true){
b[i] -= a[i];
if(b[i] < 0) break;
t++;
l++;
b[i] += 2;
}
if(t > m){
m = t;
p = i;
}
}
cout << l << "\n" << c[p];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
356 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
256 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
256 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
376 KB |
Output is correct |
| 16 |
Correct |
2 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
256 KB |
Output is correct |
| 18 |
Correct |
2 ms |
380 KB |
Output is correct |
| 19 |
Correct |
2 ms |
376 KB |
Output is correct |
| 20 |
Correct |
2 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
256 KB |
Output is correct |
| 22 |
Correct |
2 ms |
408 KB |
Output is correct |
| 23 |
Correct |
2 ms |
376 KB |
Output is correct |
| 24 |
Correct |
2 ms |
256 KB |
Output is correct |
| 25 |
Correct |
2 ms |
256 KB |
Output is correct |
