-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patheven_odds.C++
70 lines (64 loc) · 1.06 KB
/
even_odds.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
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
#include<bits/stdc++.h>
using namespace std;
/*
class node{
public:
int data;
node *next;
node(int val){
data = val;
next = NULL;
}
};
node *add(node *head, int val){
node *temp = new node(val);
if(head == NULL){
head = temp;
return head;
}
node *ptr = head;
while(ptr->next != NULL){
ptr = ptr->next;
}
ptr->next = temp;
return head;
}
int main(){
int n,k;
cin>>n>>k;
node *even = NULL;
node *odd = NULL;
for(int i=1;i<=n;i++){
if(i%2 == 0){
even = add(even,i);
}
else{
odd = add(odd,i);
}
}
node *end = odd;
while(end->next != NULL){
end = end->next;
}
end->next = even;
node *val=odd;
while(k > 1){
val = val->next;
k--;
}
cout<<val->data<<endl;
}
*/
int main(){
int n,k;
cin>>n>>k;
int half = ceil(n/2.0);
int val;
if(k <= half){
val = 1+(k-1)*2;
}
else{
val = 2+(k-half-1)*2;
}
cout<<val<<endl;
}