Submission #315183

#TimeUsernameProblemLanguageResultExecution timeMemory
315183yjojdkgk5bpCONSUL (info1cup19_consul)C++14
0 / 100
1 ms384 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
	int v,vis[1001]={0},sum=0;
	for(int i=1; i<=n; i++)
	{
		v=kth(i);
		if(vis[v]) continue;
		vis[v]=cnt(v); sum+=vis[v];
		if(abs((n-sum)/(n-i)-n/3) >=1e-6) break;
		if(vis[v]>n/3)
		{
			say_answer(v); return;
		}
	}
	say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...