| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 94135 |
2019-01-16T11:27:52 Z |
Hutch |
Go (COCI16_go) |
C++14 |
|
2 ms |
380 KB |
#include<bits/stdc++.h>
using namespace std;
struct node{
string name;
int evolve;
int mus,sum;
};
node arr[100];
int main(){
int n;
cin>>n;
int ans=0;
int maxn=0;
string maxname;
for(int i=0;i<n;i++){
cin>>arr[i].name;
cin>>arr[i].mus>>arr[i].sum;
arr[i].evolve=(arr[i].sum/(arr[i].mus-2));
if(arr[i].sum%(arr[i].mus-2)<2 && arr[i].sum>arr[i].mus)
arr[i].evolve--;
if(arr[i].evolve>maxn){
maxn=arr[i].evolve;
maxname=arr[i].name;
}
ans+=arr[i].evolve;
}
cout<<ans<<endl<<maxname<<endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
380 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 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 |
376 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 |
256 KB |
Output is correct |
| 16 |
Correct |
2 ms |
256 KB |
Output is correct |
| 17 |
Correct |
2 ms |
256 KB |
Output is correct |
| 18 |
Correct |
2 ms |
376 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 |
376 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 |
376 KB |
Output is correct |
