Cod sursa(job #139581)
Utilizator | Pripoae Teodor Anton toni2007 | Data | 20 februarie 2008 14:07:00 |
---|---|---|---|
Problema | Curcubeu | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
#define N 1000000
int main(){
int v[N],n,i,min,max,j,a,b,c;
freopen("curcubeu.in","r",stdin);
freopen("curcubeu.out","w",stdout);
scanf("%d%d%d%d",&n,&a,&b,&c);
for (i=1;i<n;++i){
a=(a*i)%n;
b=(b*i)%n;
c=(c*i)%n;
min=a;max=b;
if(a>b){
min=b;
max=a;
}
for (j=min;j<max+1;++j)
v[j]=c;
}
for (i=1;i<n;++i)
printf("%d\n",v[i]);
fclose(stdin);
fclose(stdout);
return 0;
}