제출 #311924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311924		decoqwq	Kotrljanje (COCI18_kotrljanje)	C++14	112 / 140	1302 ms	3844 KiB

kotrljanje

#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
int sum[1010000],c,d,b,m;
const int inf=1e12;
int mget(int x)
{
	int res=0;
	while(x)
	{
		res+=x%b;
		x/=b;
	}
	return res;
}
signed main()
{
	cin>>c>>d>>b>>m;
	int now=inf;
	for(int i=1;i<=1200000;i++,now+=(b-1))
	{
		int qwq=c*now+d;
		int cnt=mget(qwq);
		sum[cnt]++;
	}
	int mans=-1,pos=0;
	for(int i=1;i<=1000000;i++)
	{
		if(sum[i]>mans)
		{
			mans=sum[i],pos=i;
		}
	}
	now=inf;
	int qaq=0;
	for(int i=1;i<=1200000;i++,now+=(b-1))
	{
		int qwq=c*now+d;
		int cnt=mget(qwq);
		if(cnt==pos)
		{
			cout<<now<<" ";
			++qaq;
			if(qaq==m)
			{
				return 0;
			}
		}
	}
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 14 / 14