Cod sursa(job #2577167)

Utilizator RazvanPanaiteRazvan Panaite RazvanPanaite Data 8 martie 2020 16:37:36
Problema Curcubeu Scor 50
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.27 kb
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 1e6+10;

int a[DMAX];
int b[DMAX];
int c[DMAX];

int ans[DMAX];
int unde[DMAX];

bool uz[DMAX];

int n;

int main(){
    int t,i,j;
    int x,y;

    fin>>n>>a[1]>>b[1]>>c[1];

    unde[1]=1;
    for(i=2;i<n;i++){
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        c[i]=(1LL*c[i-1]*i)%n;
        unde[i]=i;
    }
    for(i=n-1;i>=1;i--){
        x=min(a[i],b[i]);
        y=max(a[i],b[i]);
        for(j=x;j<=y;j++){
            if(!uz[j]){
                uz[j]=true;
                ans[j]=c[i];
                unde[j]=y+1;
            }
            else j=unde[j]-1;
        }
    }
    for(i=1;i<n;i++)
        fout<<ans[i]<<'\n';

    return 0;
}