我是靠谱客的博主 勤奋灰狼,最近开发中收集的这篇文章主要介绍Codeforces Round #188 (Div. 2) / 318A Even Odds(简单数学),觉得挺不错的,现在分享给大家,希望可以做个参考。

概述

A. Even Odds
http://codeforces.com/problemset/problem/318/A
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 cincout streams or the %I64dspecifier.

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

水。


完整代码:

/*30ms,0KB*/
#include<cstdio>
int main()
{
__int64 n, k;
scanf("%I64d%I64d", &n, &k);
if (n & 1)
{
if (k > (n >> 1) + 1)
{
k -= (n >> 1) + 1;
printf("%I64d", k << 1);
}
else
printf("%I64d", (k << 1) - 1);
}
else
{
if (k > (n >> 1))
{
k -= n >> 1;
printf("%I64d", k << 1);
}
else
printf("%I64d", (k << 1) - 1);
}
return 0;
}


最后

以上就是勤奋灰狼为你收集整理的Codeforces Round #188 (Div. 2) / 318A Even Odds(简单数学)的全部内容,希望文章能够帮你解决Codeforces Round #188 (Div. 2) / 318A Even Odds(简单数学)所遇到的程序开发问题。

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

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(37)

评论列表共有 0 条评论

立即
投稿
返回
顶部