codeforces 414A Mashmokh and Numbers 模拟题

Description
It’s holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.

In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.

Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn’t know how choose the initial sequence in the right way.

Please, help him. Find n distinct integers a1, a2, …, an such that his boss will score exactly k points. Also Mashmokh can’t memorize too huge numbers. Therefore each of these integers must be at most 109.

Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).

Output
If such sequence doesn’t exist output -1 otherwise output n distinct space-separated integers a1, a2, …, an (1 ≤ ai ≤ 109).

Sample Input
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Hint
gcd(x, y) is greatest common divisor of x and y.

题意：要求你创建一组数，要求有n个，a[0]与a[1]的最大公约数，a[2]与a[3]的最大公约数，a[4]与a[5]的最大公约数…等等加起来为k。如果n为奇数，最后一个数字不参与运算，就是说是什么都可以。正确输出结果显然有多种。

思路：因为每两个数得出一个数，
如果n/2大于k,即每两个数的最大公约数都为1时都不能满足题意，输出-1；
如果n/2等于k,那么只要使每一组的最大公约数为1即可。
如果n/2小于k，令第一组的最大公约数为k-n/2+1，其它全为一即可。
注意如果k！=0,且n=1时，输出-1。

#include <iostream>

using namespace std;

int main()
{
    int n, k;
    while(cin>>n>>k)
    {
        if(n==1&&k!=0)
        {
            cout<<"-1"<<endl;
            continue;
        }
        int x=n/2;
        if(x>k)
            cout<<"-1"<<endl;
        else if(x==k)
        {
            for(int i=1; i<=n; i++)
                cout<<i<<" ";
            cout<<endl;
        }
        else
        {
            cout<<k-x+1<<" "<<2*(k-x+1)<<" ";
                for(int i=2*(k-x+1)+1; i<=2*(k-x+1)+1+n-3; i++)
                {
                    cout<<i<<" ";
                }
            cout<<endl;
        }
    }
    return 0;
}