Start: Jun, 30, 2019 09:00:00
2019年度暑期短学期第十天 助教场
End: Jul, 08, 2019 23:59:00
Time elapsed:
Time remaining:

Problem_ID: A
Result: Accepted
Time: 9ms
Memory: 1796kB
Author: 2017212212083
In contest: 1290

#include <bits/stdc++.h>

using namespace std;

#define N 10010

int s, n, m;
int ans[N];

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d %d %d", &s, &n, &m);
        int pos = 0;
        while (m != n) {
            if (m > n) {
                if (m & 1) {
                    ++m;
                    ans[++pos] = 1;
                } else {
                    m >>= 1;
                    ans[++pos] = 2;
                }
            } else {
                ++m;
                ans[++pos] = 1;
            }
        }
        if (pos <= s) {
            for (int i = pos; i >= 1; --i) {
                if (ans[i] == 1) {
                    printf("yeah!%c", " \n"[i == 1]);
                } else {
                    printf("oh!%c", " \n"[i == 1]);
                }
            }
        } else {
            puts("OMG!");
        }
    }
    return 0;
}