# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528642 | rayfish | Combo (IOI18_combo) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <climits>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
//int press(string s) {
// return 0;
//}
string guess_sequence(int N) {
string cur;
char letters[] {'A', 'B', 'X', 'Y'};
for (int i = 0; i < N; i++) {
int t_i = 0;
for (; ; t_i++) {
if (press(cur + letters[t_i]) == i+1) {
break;
}
}
cur += letters[t_i];
}
return cur;
}
int main() {
// cin.tie(0)->sync_with_stdio(0);
// freopen("team.in","r",stdin);
// freopen("team.out","w",stdout);
}