hdu 5754(dp)

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


#define N 1020
#define LL long long

bool ans[N][N];
int ans2[N][N];
bool ans3[N][N];

void init(bool f[N][N]) {
    f[1][1] = 1;
    for(int i = 1; i < N; ++i) {
        for(int j = 1; j < N; ++j) {
            if(i == 1 && j == 1) continue;
            if(f[i-1][j] || f[i][j-1] || f[i-1][j-1]) f[i][j] = 0;
            else f[i][j] = 1;
        }
    }
}
void init2(int f[N][N]) {
    f[1][1] = 1;
    for(int i = 1; i < N; ++i) {
        for(int j = 1; j < N; ++j) {
            if(i == 1 && j == 1) continue;
            bool D = 0;
            bool W = 0;
            bool L = 0;
            if(i > 1 && j > 2) {
                if(f[i-1][j-2] == -1) D = 1;
                if(f[i-1][j-2] == 0) L = 1;
                if(f[i-1][j-2] == 1) W = 1;

            }
            if(i > 2 && j > 1){
                if(f[i-2][j-1] == -1) D = 1;
                if(f[i-2][j-1] == 0) L = 1;
                if(f[i-2][j-1] == 1) W = 1;
            }
            if(W == 1) f[i][j] = 0;
            else if(D == 1) f[i][j] = -1;
            else if(!L) f[i][j] = -1;
            else f[i][j] = 1;
        }
    }
}
void init3(bool f[N][N]) {
    static bool vx[N], vy[N], vt[N * 3];
    memset(vx, 0, sizeof vx);
    memset(vy, 0, sizeof vy);
    memset(vt, 0, sizeof vt);
    vx[1] = vy[1] = vt[0 + N] = 1;
    f[1][1] = 1;
    for(int i = 1; i < N; ++i) {
        for(int j = 1; j < N; ++j) {
            if(i == 1 && j == 1) continue;
            if(vx[i] || vy[j] || vt[i-j+N]) f[i][j] = 0;
            else {
                f[i][j] = 1;
                vx[i] = vy[j] = vt[i-j+N] = 1;
            }

        }
    }
}    
int main() {
    init(ans);
    init2(ans2);
    init3(ans3);
    int cas;
    scanf("%d", &cas);
    while(cas--){
        int n, m, t;
        scanf("%d%d%d", &t, &n, &m);
        if(n < m) swap(n, m);
        int f;
        if(t == 1) {
            f = ans[n][m];
        }
        else if(t == 2) {
            if(n == m) f = 1;
            else f = 0;
        }
        else if(t == 3) {
            f = ans2[n][m];
        }
        else {
            f = ans3[n][m];
        }
        if(f == -1) puts("D");
        else if(f == 0) puts("B");
        else puts("G");
    }
    return 0;
}