# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
692067 | maks007 | Hidden Sequence (info1cup18_hidden) | 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<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define int long long
vector < int > findSequence (int N)
{
vector <int> v;
for(int i = 0; i < (1 << N); i ++) {
for(int j = 0; j < N; j ++) {
if(i & (1 << j)) v.push_back(1);
else v.push_back(0);
}
if(isSubsequence(v)) return v;
v.clear();
}
}