【HDOJ 2147】 kiki's game

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#define LL long long
#define INF 0x3f3f3f3f

using namespace std;

bool dp[2333][2333];
int dirx[] = {-1, -1, 0};
int diry[] = { 0,-1,-1};

int main()
{
    memset(dp,0,sizeof(dp));
    int i,j,k,m,n;
    dp[1][1] = dp[0][1] = dp[1][0] = 1;

    for(i = 0; i <= 2000; ++i)
    {
        for(j = i; j <= 2000; ++j)
        {
            for(k = 0; k < 3; ++k)
            {
                int x = i+dirx[k];
                int y = j+diry[k];
                if(x < 0 || y < 0) continue;
                if(!dp[x][y]) dp[i][j] = dp[j][i] = 1;
            }
        }
    }
    while(~scanf("%d %d",&m,&n) && m)
    {
        if(dp[m-1][n-1]) printf("Wonderful!\n");
        else puts("What a pity!");
    }
    return 0;

#include <iostream>

using namespace std;

int main()
{
    int m,n;
    while(cin>>m>>n && m)
        cout<<(!(m&1)||!(n&1)?"Wonderful!":"What a pity!")<<endl;
    return 0;
}