# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096489 | YugiHacker | Go (COCI16_go) | C++17 | 1 ms | 348 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.
/*
www.youtube.com/YugiHackerChannel
oj.vnoi.info/user/YugiHackerKhongCopCode
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 72
using namespace std;
int n;
string s[maxn];
int a[maxn], b[maxn], ans[maxn];
main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
f1 (i, n)
{
cin >> s[i] >> a[i] >> b[i];
while (b[i] >= a[i])
{
int tmp = b[i]/a[i];
ans[i] += tmp;
b[i] = b[i] % a[i] + tmp * 2;
}
}
cout << accumulate(ans+1, ans+n+1, 0ll); el;
cout << s[max_element(ans+1, ans+n+1) - ans];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |