概述
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.
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 %I64dspecifier.
Print the number that will stand at the position number k after Volodya's manipulations.
10 3
5
7 7
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(简单数学)所遇到的程序开发问题。
如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。
发表评论 取消回复