Pagini recente » Borderou de evaluare (job #361036) | Cod sursa (job #2629037) | Cod sursa (job #1679151) | Cod sursa (job #1570382) | Cod sursa (job #417934)
Cod sursa(job #417934)
#include<stdio.h>
FILE *in,*out;
int n,a[999999],b[999999],c[999999],cul[999999];
int min,max,j,i;
int main()
{
in=fopen("curcubeu.in","rt");
out=fopen("curcubeu.out","wt");
fscanf(in,"%d %d %d %d",&n,&a[0],&b[0],&c[0]);
min=a[0];
max=b[0];
if(a[0]>b[0])
{
min=b[0];
max=a[0];
}
for(i=min;i<=max;i++)
cul[i]=c[0];
for(i=1;i<n-1;i++)
{
a[i]=((long long)a[i-1]*(i+1))%n;
b[i]=((long long)b[i-1]*(i+1))%n;
c[i]=((long long)c[i-1]*(i+1))%n;
min=a[i];
max=b[i];
if(a[i]>b[i])
{
min=b[i];
max=a[i];
}
for(j=min;j<=max;j++)
cul[j]=c[i];
}
for(i=1;i<=n-1;i++)
fprintf(out,"%d\n",cul[i]);
return 0;
}