Cod sursa(job #1461744)

Utilizator PopoviciRobertPopovici Robert PopoviciRobert Data 16 iulie 2015 13:36:00
Problema Curcubeu Scor 0
Compilator c Status done
Runda Arhiva de probleme Marime 0.89 kb
#include <stdio.h>
#include <stdlib.h>
#define MAXN 1000000
int v[MAXN],a[MAXN],b[MAXN],c[MAXN];
int main(){
    FILE*fi,*fout;
    int i,j,flag,con,n;
    fi=fopen("curcubeu.in" ,"r");
    fout=fopen("curcubeu.out" ,"w");
    fscanf(fi,"%d%d%d%d" ,&n,&a[1],&b[1],&c[1]);
    flag=1;
    i=2;
    while(flag){
        for(j=a[i-1];j<=b[i-1];j++)
            v[j]=c[i-1];
        a[i]=(a[i-1]*i)%n;
        b[i]=(b[i-1]*i)%n;
        c[i]=(c[i-1]*i)%n;
        j=i-1;
        while(j>=0&&(a[j]!=a[i]||b[j]!=b[i]))
            j--;
        if(j>=0)
            flag=0;
        else{
            i++;
            con=0;
            for(j=1;j<n;j++)
                if(v[j]>0)
                    con++;
            if(con==n-1)
                flag=0;
        }
    }
    for(i=1;i<n;i++)
        fprintf(fout,"%d\n" ,v[i]);
    fclose(fi);
    fclose(fout);
    return 0;
}