Pagini recente » Cod sursa (job #1440354) | Cod sursa (job #2444054) | Cod sursa (job #1310061) | Cod sursa (job #1778370) | Cod sursa (job #2652212)
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a,b,c,l[1000005],r[1000005],nr[1000005],last[1000005],ans[1000005];
int32_t main(){
CODE_START;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
cin>>n>>a>>b>>c;
l[1]=min(a,b);
r[1]=max(a,b);
nr[1]=c;
last[1]=1;
for(ll i=2;i<n;i++)
{
a*=1ll*i;
a%=n;
b*=1ll*i;
b%=n;
c*=1ll*i;
c%=n;
l[i]=min(a,b);
r[i]=min(a,b);
nr[i]=c;
last[i]=i;
}
for(ll i=n-1;i>=1;i--)
{
for(ll j=l[i];j<=r[i];j++)
{
if(ans[j]){
ll x=last[j];
last[j]=max(last[j],r[i]);
j=x;
}else {
ans[j]=nr[i];
last[j]=r[i];
}
}
}
for(ll i=1;i<n;i++)
{
cout<<ans[i]<<endl;
}
}