# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546508 | srivatsav_kannan | Combo (IOI18_combo) | C++14 | 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 <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cstring>
#include <bitset>
#include <climits>
#include <valarray>
#include <list>
#define int long long
#define INF 1000000000
#define endl '\n'
#define mod 1000000007
using namespace std;
string guess_sequence(int n){
string ans;
string ar[4] = {"A", "B", "X", "Y"};
for (int i = 0; i < n; i++){
for (int i = 0; i < 4; i++) if (press(ar[i]) == 1) ans += ar[i];
}
return ans;
}
//signed main(){
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
//
//}