zoukankan      html  css  js  c++  java
  • Codeforce 318A

    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

    Copy

    10 3
    

    output

    Copy

    5
    

    input

    Copy

    7 7
    

    output

    Copy

    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<bits/stdc++.h>
    using namespace std;
    int main() {
        long long n , k ; cin >> n >> k;
        cout << ((n + 1) / 2 >= k ? k * 2 - 1 : 2 * (k - (n + 1) / 2));
    }
    
    
  • 相关阅读:
    Kth Ancestor 第k个祖先问题
    centOS 6.4挂载centOS分区
    上阶段学习总结
    code testing
    Helo~
    leetcode--Maximum Subarray
    leetcode--Climbing Stairs
    leetcode--Search Insert Position
    leetcode--Best Time to Buy and Sell Stock III
    leetcode--Best Time to Buy and Sell Stock II
  • 原文地址:https://www.cnblogs.com/RioTian/p/13184194.html
Copyright © 2011-2022 走看看