HDU2149 Public Sale，巴什博奕

有一堆n個物品,兩個人輪流從這堆物品中取物,規定每次至少取p個,最多取q個.最後取光者得勝.

 n = (m+1)r+s , (r爲任意自然數,s≤m), 即n%(p+q) != 0, 則先取者肯定獲勝(默認最後一個取的爲win)

/*******************************************************************************
 # Author : Neo Fung
 # Email : [email protected]
 # Last modified: 2012-07-19 18:57
 # Filename: HDU2149 Public Sale.cpp
 # Description : 有一堆n個物品,兩個人輪流從這堆物品中取物,規定每次至少取p個,最多取q個.最後取光者得勝.
 n = (m+1)r+s , (r爲任意自然數,s≤m), 即n%(p+q) != 0, 則先取者肯定獲勝(默認最後一個取的爲win)
 ******************************************************************************/
#ifdef _MSC_VER
#define DEBUG
#define _CRT_SECURE_NO_DEPRECATE
#endif

#include <fstream>
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <functional>
#include <ctype.h>
using namespace std;

const int kMAX=10010;
const double kEPS=10E-6;

int main(void)
{
#ifdef DEBUG  
  freopen("../stdin.txt","r",stdin);
  freopen("../stdout.txt","w",stdout); 
#endif  

  int n,m;

  while(~scanf("%d%d",&m,&n) )
  {
		int t=m%(1+n);
		if(!t)
			printf("none\n");
		else
			printf("%d\n",t);
  }

  return 0;
}