| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 210433 | tleontest1 | Go (COCI16_go) | C++14 | 5 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.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long int lo;
typedef pair<int,int> PII;
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
 
const lo mod = 1000000007;
const lo li = 100005;
const lo inf = 1000000000;
const lo MAX = 1000000000000000000;
const lo MIN = -1000000000000000000;
const lo LOG = 30;
 
lo n,m,cev,k,mx=-inf,yes;
string s;
string ss;
 
int main(){
	scanf("%lld",&n);
	FOR{
		cin>>s;
		cin>>m>>k;
		lo at=0;
		while(k>=m){
			k-=m;
			k+=2;
			at++;
		}
		//~ int at=k/(m-2);
		yes+=at;
		if(at>mx){ss=s;}
		mx=max(mx,at);
	}
	cout<<yes<<endl;
	cout<<ss;
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
