Pagini recente » Borderou de evaluare (job #1375640) | Borderou de evaluare (job #2311440) | Borderou de evaluare (job #1845994) | Borderou de evaluare (job #2272087) | Cod sursa (job #260864)
Cod sursa(job #260864)
#include <cstdio>
using namespace std;
int P[262145];
int main(int argc, char *argv[]) {
int N, i, c = 0, n, r = 0;
FILE *fi = fopen("euler.in", "r");
fscanf(fi, "%d", &N);
i = 0;
while (fscanf(fi, "%d", &n) != EOF) {
if (!r)
r = n;
if (n != P[c]) {
if (((n == r) && (c != 0)) || (P[n] && (P[n] != c)))
break;
P[n] = c;
}
c = n;
++i;
}
fclose(fi);
FILE *fo = fopen("euler.out", "w");
if (i != 2*N-1) {
fprintf(fo, "NU\n");
} else {
fprintf(fo, "DA\n");
for (i = 1; i <= N; ++i)
fprintf(fo, "%d ", P[i]);
fprintf(fo, "\n");
}
fclose(fo);
return 0;
}