Cod sursa(job #658625)
| Utilizator | Data | 9 ianuarie 2012 10:57:20 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<stdio.h>
#include<fstream>
using namespace std;
ifstream f("curcubeu.in");
FILE *g = fopen("curcubeu.out","w");
#define MaxN 1000100
int N,A,B,C,D[MaxN],cul[MaxN];
int main()
{
f >> N >> A >> B >> C;
for(int i=1;i<N;i++)
{
A = (A*i)%N;
B = (B*i)%N;
C = (C*i)%N;
for(int j=A;j<=B;D[j] ? j = D[j] : j ++)
!D[j] ? D[j] = B+1,cul[j] = C : 0;
}
for(int i=1;i<N;i++)
fprintf(g,"%d\n",cul[i]);
return 0;
}