题目大意:
就是最简单的巴什博弈...
大致思路:
对个解的情况就是走的步数多余上限的情况
否则就控制位置在(能走的最大步数 长度+ 1)倍数的位置
代码如下:
Result : Accepted Memory : 1576 KB Time : 0 ms
/*
* Author: Gatevin
* Created Time: 2015/5/6 20:08:10
* File Name: Rin_Tohsaka.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
#define foreach(e, x) for(__typeof(x.begin()) e = x.begin(); e != x.end(); ++e)
#define SHOW_MEMORY(x) cout<<sizeof(x)/(1024*1024.)<<"MB"<<endl
int n, m;
int main()
{
while(scanf("%d %d", &n, &m) != EOF)
{
if(n % (m + 1) == 0)
{
puts("none");
continue;
}
if(m >= n)
for(int i = n; i <= m; i++)
printf("%d%c", i, i == m ? '\n' : ' ');
else printf("%d\n", n % (m + 1));
}
return 0;
}