Cod sursa(job #895849)
| Utilizator | Data | 27 februarie 2013 12:47:12 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
#define maxn 1000000
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int a,b,c,n,i,j,v[maxn];
int main(){
f>>n;
f>>a>>b>>c;
for(int j=min(a,b);j<=max(a,b);++j)
v[j]=c;
for(int i=2;i<n;++i){
a=(a%n*i%n)%n;
b=(b%n*i%n)%n;
c=(c%n*i%n)%n;
for(int j=min(a,b);j<=max(a,b);++j)
v[j]=c;
}
for(int i=1;i<n;++i)
g<<v[i]<<endl;
return 0;
}