Cod sursa(job #18665)
| Utilizator | Data | 18 februarie 2007 12:56:11 | |
|---|---|---|---|
| Problema | Culori | Scor | 0 |
| Compilator | c | Status | done |
| Runda | preONI 2007, Runda 2, Clasele 11-12 | Marime | 0.47 kb |
#include <stdio.h>
#define FIN "culori.in"
#define FOUT "culori.out"
#define MAX 1000
long N, i, A[MAX];
long val;
int main() {
freopen(FIN, "r", stdin);freopen(FOUT, "w", stdout);
scanf("%ld", &N);
N = 2*N-1;
for (i=0; i<N; ++i)
scanf("%ld", A+i);
val = 1;
for (i=0; i<N; ) {
long tmp=0;
for (; A[i]==A[i+2] && A[i+1] == A[i+3]; i+=2, tmp++);
if ( tmp )
val*=(tmp*2), val %= 9901;
i+=2;
}
printf("%ld\n", val);
fclose(stdin); fclose(stdout);
return 0;
}
