# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94129 | Yigit | Go (COCI16_go) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int bul(int gerek,int var){
int sonuc=0;
while(var>=gerek){
sonuc+=var/gerek;
int ekle=(var/gerek)*2;
var-=(var/gerek)*gerek;
var+=ekle;
}
return sonuc;
}
int main(){
int n,diz[10000],i,need,have,toplam=0,ma=0;
char ar[10000][21];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",ar[i]);
scanf("%d",&need);
scanf("%d",&have);
int x=bul(need,have);
diz[i]=x;
if(diz[ma]<x)ma=i;
toplam+=x;
}
printf("%d\n%s",toplam,ar[ma]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |