Submission #23505178

---

Source Code Expand

#include<bits/stdc++.h>

#define ll long long 

using namespace std;

int read()
{
	int a=0,f=1,c=getchar();
	while(!isdigit(c))
	{
		if(c=='-')f=-1;
		c=getchar();
	}
	while(isdigit(c))
	{
		a=a*10+c-'0';
		c=getchar();
	}
	return a*f;
}

const int N=1e5+10;

ll p,a,b;
bool vis[N];

int main()
{
//	freopen("1.in","r",stdin);
	
	p=read();
	a=read();b=read();
	
	ll x=1;int cir=1;
	for(;;++cir)
	{
		x=x*a%p;
		if(x==1)break;
	}
	if(cir%2==1)
	{
		swap(a,b);
		cir=(p-1)/cir;
	}
	
	ll ia=1,ib=1;
	for(int i=1;i<=p-2;++i)ia=ia*a%p;
	for(int i=1;i<=p-2;++i)ib=ib*b%p;
	
	x=1;
	vector<ll> ans;
	vis[x]=1;ans.push_back(x);
	if((p-1)/cir==1)
	{
		for(int i=1;i<=cir;++i)
		{
			x=x*a%p;
			if(vis[x] && !(i==cir && x==1)){puts("No");return 0;}
			vis[x]=1;ans.push_back(x);
		}
	}
	else
	{
		x=x*b%p;
		if(vis[x]){puts("No");return 0;}
		vis[x]=1;ans.push_back(x);
		
		for(int i=1;i<=cir;++i)
		{
			int t=i%2==1?b:ib;
			for(int j=1;j<=(p-1)/cir-2;++j)
			{
				x=x*t%p;
				if(vis[x]){puts("No");return 0;}
				vis[x]=1;ans.push_back(x);
			}
			if(i<cir)
			{
				x=x*a%p;
				if(vis[x]){puts("No");return 0;}
				vis[x]=1;ans.push_back(x);
			}
		}
		
		x=x*ib%p;
		if(vis[x]){puts("No");return 0;}
		vis[x]=1;ans.push_back(x);
		
		for(int i=1;i<=cir-1;++i)
		{
			x=x*ia%p;
			if(vis[x] && !(i==cir-1 && x==1)){puts("No");return 0;}
			vis[x]=1;ans.push_back(x);
		}
	}
	
	puts("Yes");
	for(int i=0;i<(int)ans.size();++i)printf("%lld ",ans[i]);
	puts("");
	
	return 0;
}

Submission Info

Judge Result