Cod sursa(job #85926)
Utilizator | Puni Andrei Paul crawler | Data | 23 septembrie 2007 11:42:32 |
---|---|---|---|
Problema | Curcubeu | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Autumn Warmup 2007, Runda 2 | Marime | 0.48 kb |
#include <cstdio>
#include <vector>
using namespace std;
#define Nmax 1000100
int a,b,c,n, x[Nmax];
int main()
{
freopen("curcubeu.in","r",stdin);
freopen("curcubeu.out","w",stdout);
scanf("%d%d%d%d",&n,&a,&b,&c);
#define Q(s) s=(long long)((s*i)%n)
int i=0;
while(++i<n)
{
Q(a); Q(b); Q(c);
if(a>b) swap(a,b);
for (int k=a;k<=b;++k) x[k] = c;
}
for (int w=1;w<n;++w) printf("%d\n",x[w]);
return 0;
}