Problem--318A--Codeforces--A. Even Odds

A. Even Odds
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first n. He writes down the following sequence of numbers: firstly all odd integers from 1 to n (in ascending order), then all even integers from 1 to n (also in ascending order). Help our hero to find out which number will stand at the position number k.

Input
The only line of input contains integers n and k (1 ≤ k ≤ n ≤ 1012).

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output
Print the number that will stand at the position number k after Volodya’s manipulations.

Examples
input
10 3
output
5
input
7 7
output
6

Note
In the first sample Volodya’s sequence will look like this: {1, 3, 5, 7, 9, 2, 4, 6, 8, 10}. The third place in the sequence is therefore occupied by the number 5.

note:小心超时

#include<stdio.h>
int main(){
long long
n,k;
scanf("%I64d%I64d",&n,&k);
k<=(n+1)/2?printf("%I64dn",2*k-1):printf("%I64dn",2*(k-(n+1)/2));
return 0;
}

最后

以上就是机灵豌豆为你收集整理的Problem--318A--Codeforces--A. Even Odds的全部内容，希望文章能够帮你解决Problem--318A--Codeforces--A. Even Odds所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。