-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconstructionOfArray.c
43 lines (33 loc) · 968 Bytes
/
constructionOfArray.c
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
#include <stdio.h>
int main() {
int t;
scanf("%d", &t);
for(int i = 0; i < t; i++){
int n;
scanf("%d", &n);
if((n / 2) % 2 != 0){
printf("NO\n");
}else{
printf("YES\n");
int sum1 = 0, sum2 = 0;
int arr1[n / 2], arr2[n / 2];
for (int i = 0; i < n / 2; i++) {
arr1[i] = 2 * (i + 1);
sum1 += arr1[i];
}
for (int i = 0; i < n / 2 - 1; i++) {
arr2[i] = 2 * i + 1;
sum2 += arr2[i];
}
arr2[n / 2 - 1] = sum1 - sum2;
for (int i = 0; i < n / 2; i++) {
printf("%d ", arr1[i]);
}
for (int i = 0; i < n / 2; i++) {
printf("%d ", arr2[i]);
}
printf("\n");
}
}
return 0;
}