# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67129 | 2018-08-13T11:11:59 Z | ege_eksi | DEL13 (info1cup18_del13) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int> S; bool generateAll(int n) { if(S.size() == n) { if(isSubsequence(S) == true) { return true; } else { return false; } } S.push_back(0); if(generateAll(S) == true) { return true; } S.pop_back(); S.push_back(1); if(generateAll(S) == true) { return true; } S.pop_back(); return false; } vector < int > findSequence (int N) { generateAll(N); return S; }