blob: 9c1c1b1c67d16a4f49730f9544c25ecc98dfb878 (
plain) (
tree)
|
|
#include <stdio.h>
#include <stdbool.h>
int main (void) {
int n;
scanf("%d", &n);
int a[2*n];
unsigned int lsum = 0;
unsigned int rsum = 0;
for (int i = 0; i < 2*n; i++)
scanf("%d", &a[i]);
for (int k = 0;; k++) {
if (lsum == rsum) {
bool pravilno = true;
for (int j = 0; j < n; j++) {
// fprintf(stderr, "%d\t%d\t%d\t%d\n", j, a[j], (n+(n-k+j) % n), a[(n+(n-k+j) % n)]);
if (a[j] == a[n+(n-k+j) % n])
continue;
pravilno = false;
break;
}
if (pravilno) {
printf("%d\n", k);
break;
}
}
lsum += a[k];
rsum += a[2*n-1-k];
}
}
|