G. Nim plus

一个 简单 sg 函数

#include 
#include 
#include 
using namespace std;
int n, m;
int f[2][105];
int sg[2][5005];

void getSG() 
{
    for (int i = 1; i <= n; i++)
    {
    	for (int j = 1; j <= m and f[0][j] <= i; j++) 
    		if (sg[1][i-f[0][j]] == 0) 
    			sg[0][i] = 1;
    		
    	for (int j = 1; j <= m and f[1][j] <= i; j++)
    		if (sg[0][i-f[1][j]] == 0)
    			sg[1][i] = 1;
    }
}

int main()
{
	cin >> n >> m;
	
	for(int i = 1; i <= m; i++) cin >> f[0][i];
	
	for(int i = 1; i <= m; i++) cin >> f[1][i];
	
	getSG();
	
	if(sg[0][n]) puts("Long Long nb!");
	else puts("Mao Mao nb!");
	
	return 0;
}