-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinverse.cpp
55 lines (54 loc) · 921 Bytes
/
inverse.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
#include <stdio.h>
int main(){
int num;
int sum;
scanf("%d", &num);
scanf("%d", &sum);
int sol[num];
if(num==1){
sol[0]=sum;
}
else if(num%2==0){
for(int i=0; i<(num-1)/2; i++){
if(num>sum && sum>=0){
sol[i] = i+1+sum;
sol[num-1-i] = -(i+1+sum);
}
else if(num>sum && sum<0){
sol[i] = i+1-sum;
sol[num-1-i] = -(i+1-sum);
}
else if(num<sum){
sol[i] = i+1;
sol[num-1-i] = -(i+1);
}
}
sol[(num-1)/2]= 0;
sol[num/2] = sum;
}
else if(num%2==1){
for(int i=0; i<(num-1)/2; i++){
if(num>sum && sum>=0){
sol[i] = i+1+sum;
sol[num-1-i] = -(i+1+sum);
}
else if(num>sum && sum<0){
sol[i] = i+1-sum;
sol[num-1-i] = -(i+1-sum);
}
else if(num<sum){
sol[i] = i+1;
sol[num-1-i] = -(i+1);
}
}
sol[num/2] = sum;
}
for(int i=0; i<num; i++){
if(i==num-1){
printf("%d", sol[i]);
}
else{
printf("%d ", sol[i]);
}
}
}