# Codeforces 318A Even Odds

349人阅读 评论(0)

A. Even Odds

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard 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.

Sample test(s)

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.

#include<iostream>
typedef __int64 tt;
using namespace std;

int main()
{
tt n,k;
while(cin>>n>>k){
if(n % 2 == 0)
{
if(k <= n/2)  cout <<2 *k -1;

else  cout << 2 *( k - n / 2);
}
else
{
if(k <= n / 2 + 1) cout << 2 *k -1;

else cout<< 2 *( k - n / 2 - 1);
}

cout<<endl ;

}
return 0;
}

0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：3867次
• 积分：179
• 等级：
• 排名：千里之外
• 原创：14篇
• 转载：0篇
• 译文：0篇
• 评论：3条
文章分类
阅读排行
评论排行