Cod sursa(job #1076479)
| Utilizator | Data | 10 ianuarie 2014 12:07:24 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int n,a,b,c,k,Min,Max,i;
int v[1000001];
int main()
{
f>>n;
f>>a;
f>>b;
f>>c;
k=1;
while((a!=0||b!=0)&&(k<=n-1))
{
Min=min(a,b);
Max=max(a,b);
for(i=Min;i<=Max;++i) v[i]=c;
++k;
a=(a*k)%n;
b=(b*k)%n;
c=(c*k)%n;
}
for(i=1;i<=n-1;++i) g<<v[i]<<"\n";
return 0;
}
