| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 317000 | daniel920712 | 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;
vector < int > temp;
vector < int > findSequence (int N)
{
vector < int > ans (N, 0);
for(i=0;i<(1<<N);i++)
{
temp.clear();
for(j=0;j<N;j++)
{
if(i&(1<<j)) temp.push_back(1);
else temp.push_back(0);
}
if(isSubsequence(temp)) return temp;
}
}
