黑发黑眼 & hdu2147

Description

Solution

考试的时候是打表找规律做的，考完了尝试证明了一下

我们画一下 $PN$ 图

可以发现，$n$ 和 $m$ 只要有一个为偶数， $HJA$ 就获胜。

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;

#define N 100001
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define drp(i, a, b) for (int i = a; i >= b; i--)
#define fech(i, x) for (int i = 0; i < x.size(); i++)
#define ll long long

inline int read() {
    int x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (!(ch ^ '-')) flag = -1; ch = getchar(); }
    while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar(); return x * flag;
}

inline void write(int x) {
    if (!x) { putchar('0'); return; } if (x < 0) putchar('-'), x = -x;
    char buf[20] = ""; int top = 0; while (x) buf[++top] = x % 10 + '0', x /= 10; while (top) putchar(buf[top--]);
}

int n, m;

int main() {
    while (scanf("%d%d", &n, &m) == 2 && n && m) {
        puts(((n & 1) && (m & 1)) ? "What a pity!" : "Wonderful!");
    }
    return 0;
}