题解 | #取石子#

```#include <bits/stdc++.h>
#define int long long
using namespace std;
int stone[3] = {1 ,3 , 9};
signed main()
{
    int n1 , n2 ; 
    while(cin >> n1 >> n2)
    {
        vector<vector<bool>>dp(n1 + 2 , vector<bool>(n2 + 2 ,false));
        for(int i = 0 ;i < n1 + 1 ; i++)
        {
            for(int j = 0 ; j < n2 + 1 ; j++)
            {
                if(i == 0 && j == 0)continue;
                for(int k : stone)
                {
                    if(i - k >= 0)
                    {
                        int new_x = i - k ;
                        int new_y = j ;
                        dp[i][j] = dp[i][j] | !dp[new_x][new_y];
                    }
                    
                    if(j - k >= 0)
                    {
                        int new_x = i ;
                        int new_y = j - k ;
                        dp[i][j] = dp[i][j] | !dp[new_x][new_y];
                    }
                }
            }
        }
        if(dp[n1][n2])
        {
            cout << "win" << endl;
        }
        else
        {
            cout << "lose" << endl;
        }
    }
    return 0 ; 
}