传送门:点击打开链接
题意:两人竞拍,每次加价的价格在[1,n]范围内,第一次>=m的赢
思路:巴什博弈,当m%(n+1)!=0时,先手赢,否则后手赢
#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define fuck(x) cout<<"["<<x<<"]"
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w+",stdout)
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;
const int MX = 5e5 + 5;
int main() {
int n, m; //FIN;
while(~scanf("%d%d", &m, &n)) {
if(m % (n + 1) == 0) printf("none\n");
else {
if(n >= m) {
for(int i = m; i <= n; i++) {
printf("%d%c", i, i == n ? '\n' : ' ');
}
} else printf("%d\n", m % (n + 1));
}
}
return 0;
}