research.cpp

#include <bits/stdc++.h>

int main() {
    const int N = 101;
    static char isWin[N][N][N];
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            for (int k = 0; k < N; ++k) {
                if (i + j + k == 0) { continue; }
                for (int x = 1; x < N; ++x) {
                    if (i - x >= 0 && (j != k || j == 0 || k == 0) && (i - x != j || i - x == 0 || j == 0) && (i - x != k || i - x == 0 || k == 0) && !isWin[i-x][j][k]) {
                        isWin[i][j][k] = 1;
                    }
                    if (j - x >= 0 && (i != k || i == 0 || k == 0) && (j - x != i || i == 0 || j - x == 0) && (j - x != k || k == 0 || j - x == 0) && !isWin[i][j-x][k]) {
                        isWin[i][j][k] = 1;
                    }
                    if (k - x >= 0 && (i != j || i == 0 || j == 0) && (k - x != i || i == 0 || k - x == 0) && (k - x != j || j == 0 || k - x == 0) && !isWin[i][j][k-x]) {
                        isWin[i][j][k] = 1;
                    }
                }
            }
        }
    }
    printf("Bad positions:\n");
    for (int a = 1; a < N; ++a) {
        for (int b = a + 1; b < N; ++b) {
            for (int c = b + 1; c < N; ++c) {
                if (!isWin[a][b][c]) {
                    printf("\t%d %d %d\n", a, b, c);
                }
            }
        }
    }
    return 0;
}