-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1343b 오류발견 ><.cpp
107 lines (78 loc) · 1.82 KB
/
1343b 오류발견 ><.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
int suma;
int sumb;
int subn=0;
int n;
cin>>t;
for(int i=0;i<t;i++)
{
cin>>n;
int a[n];
suma=sumb=0;
subn=n/2;
if(subn%2==1)
{
cout<<"NO"<<endl;
}
else
{
cout<<"YES"<<endl;
for(int i=0;i<subn;i++)
{
a[i]=2*(i+1);
suma=suma+a[i];
}
for(int i=0,j=subn;j<n;i++,j++)
{
//a[j]=2*(i+1)-1;
if(j<n-1)
{
a[j]=2*(i+1)-1;
sumb=sumb+a[j];
}
//a[j==n-1]=suma-sumb;
if(j==n-1)
{
a[j]=suma-sumb;
}
//a[n-1]=suma-sumb;
//if(j==n-1)
//{
/*for(int j=subn;j<n-1;j++)
{
//a[j]=a[j]+a[j+1];
sumb=sumb+a[j];
}
if(j==n-1)
{
a[j]=suma-sumb;
}*/
//a[n-1]=suma-su
//}
}
//a[n-1]=suma-sumb;
for(int k=0;k<n;k++)
{
cout<<a[k]<<" ";
if(k==n-1)
{
cout<<endl;
}
}
}
}
/*
출력 파트 구현하기
5
2
4
6
8
10
*/
return 0;
}