# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
929999 | sofiefu | Ancient Machine 2 (JOI23_ancient2) | 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 <bits/stdc++.h>
#include "ancient2.h"
using namespace std;
typedef long long ll;
#define int long long
#define vo vector
#define fi first
#define se second
#define pr(x) cerr << #x << " " << x << endl;
#define sz(x) x.size()
typedef vo<int> vi;
typedef pair<int, int> pii;
#define rep(i, a, b) for(ll i = (a); i<(b); i++)
ll const inf = LLONG_MAX, mxn = 51;
std::string Solve(int n){
string ans;
rep(i, 0, 1000){a
int ret = Query(2, {0, 0}, {1, 1});
if(ret==0){
ans.push_back('0');
}
else{
ans.push_back('1');
}
}
return ans;
}