From ea16ca94bcff9f6a13dda843bd9eb642979d4441 Mon Sep 17 00:00:00 2001
From: Shazid Mashrafi <shazid456@gmail.com>
Date: Mon, 7 Aug 2023 02:17:14 +0600
Subject: [PATCH] initial commit

---
 318A Even Odds/318A.cpp | 60 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 318A Even Odds/318A.cpp

diff --git a/318A Even Odds/318A.cpp b/318A Even Odds/318A.cpp
new file mode 100644
index 0000000..de474f0
--- /dev/null
+++ b/318A Even Odds/318A.cpp	
@@ -0,0 +1,60 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+ll fact(ll n){ if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res;}
+ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+#define PI          3.141592653589793238;
+#define INF         LONG_LONG_MAX;
+#define MOD         1e9+7;
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    ll n,k;
+    cin>>n>>k;
+    if(k<=n/2)
+        cout<<2*k-1<<nl;
+    else
+    {
+        if(n&1)
+        {
+            if(k==n/2+1)
+                cout<<n<<nl;
+            else
+                cout<<2*(k-n/2-1)<<nl;
+        }
+        else
+            cout<<2*(k-n/2)<<nl;
+    }       
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    //cin >> TC;
+    while (TC--) solve();
+}
\ No newline at end of file