Cod sursa(job #1907704)
| Utilizator | Data | 6 martie 2017 20:34:34 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#define N 1000010
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int i,j,n,m,k,t,p,r,a,b,c,v[N];
int main()
{
f>>n;
f>>a>>b>>c;
for(i=1;i<n;i++)
{
for(int j=min(a,b);j<=max(a,b);j++)
v[j]=c;
if(v[i]<n-1)
{
a=(a*(i+1))%n;
b=(b*(i+1))%n;
c=(c*(i+1))%n;
}
}
for(i=1;i<n;i++)
g<<v[i]<<"\n";
}
