Cod sursa(job #1171867)
| Utilizator | Data | 16 aprilie 2014 15:10:57 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
long long n,a,b,c;
long long v[1000005];
int main()
{
int i,j;
fin>>n>>a>>b>>c;
v[min(a,b)]+=c;
v[max(a,b)+1]-=c;
for (i=2;i<=n-1;i++)
{
a=(1LL*a*i)%n;
b=(1LL*b*i)%n;
c=(1LL*c*i)%n;
v[min(a,b)]+=c;
v[max(a,b)+1]-=c;
}
for (j=1;j<=n-1;j++)
{
v[j]+=v[j-1];
fout<<v[j]<<"\n";
}
fout<<"\n";
return 0;
}
