Result: Accepted
Time: 9ms
Memory: 1796kB
#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;
}