hdu2149nim博弈输出

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-9;
const int N=1000000+10,maxn=111117,inf=11111;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    while(cin>>m>>n){
        int s=m%(n+1);
        if(s==0)cout<<"none"<<endl;
        else
        {
            if(m>n+1)cout<<s<<endl;
            else if(m<=n)
            {
                for(int i=m;i<=n;i++)
                    cout<<i<<(i==n ? ‘\n‘:‘ ‘);
            }
        }
    }
    return 0;
}