-
Notifications
You must be signed in to change notification settings - Fork 0
/
PeatShare.cpp
58 lines (52 loc) · 1.22 KB
/
PeatShare.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
using namespace std;
int a[100100];
int main(){
int q,N,i,j,k;
int sumLeft,sumRight;
int mark = 0;
scanf("%d", &q);
while(q--){
scanf("%d", &N);
for(i = 1 ; i <= N ; i++){
scanf("%d" , &a[i]);
}
for(i = 1 ; i <= N ; i++){ // first solution
for(j = 1 ; j <= i ; j++){
sumLeft += a[j];
}
for(k = N-i+1 ; k >= i ; k--){
sumRight += a[k];
}
if(sumLeft == sumRight){
printf("%d" , i);
mark = 1;
}
sumRight = 0;
sumLeft = 0;
}
for(i = 1 ; i <= N ; i++){ // second solution
for(j = 1 ; j <= i ; j++){
sumLeft += a[j];
}
for(k = N-i+1 ; k >= i ; k--){
sumRight += a[k];
}
if(sumLeft == sumRight){
printf("%d" , i);
}
sumRight = 0;
sumLeft = 0;
}
if(mark == 0){
printf("NO");
}
mark = 0;
}
return 0;
}
/*
1
8
3 1 2 1 1 2 1 1
*/