Bittijono

input/code.cpp: In function 'void next(std::string, long int)':
input/code.cpp:30:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (index + 1 != bittijono.size())
                                  ^
input/code.cpp:32:47: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (long i = index + 1; i < bittijono.size(); i++)
                                               ^
input/code.cpp: In function 'void moar()':
input/code.cpp:43:47: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (long c = 0; c < combinations[t].length(); c++)
                                               ^

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long int tolookfor;
string good_bitti_jono = "";
bool found = false;
vector<string> combinations = {};
bool exists(string x)
{
	if (std::find(combinations.begin(), combinations.end(), x) != combinations.end())
	{
		return true;
	}
	else
	{
		return false;
	}
}
vector<int> bittijono = {};
void next(string sofar, long index)
{
	//cout << "START" << endl;
	string now = sofar + to_string(bittijono[index]);
	if (exists(now) == false)
	{
		combinations.push_back(now);
	}
	if (index + 1 != bittijono.size())
	{
		for (long i = index + 1; i < bittijono.size(); i++)
		{
			next(now, i);
		}
	}
}
void moar()
{
	long long int size = combinations.size();
	for (long t = 0; t < size; t++)
	{
		for (long c = 0; c < combinations[t].length(); c++)
		{
			string newstr = combinations[t];
			//cout << "NEWSTR BEFORE ERASE:  " << newstr << endl;
			newstr.erase(0, 1);
			//cout << "NEWSTR AFTER ERASE: " << newstr << endl;
			if (exists(newstr) == false)
			{
				if (newstr.length() > 0)
				{
					combinations.push_back(newstr);
				}
			}
		}
	}
}
long long int getSize(vector<int> jono)
{
	bittijono = jono;
	string x = "";
	next(x, 0);
	moar();
	long long size = combinations.size();
	combinations = {};
	return size;
}
/*
int main()
{
	vector<int> y = {1,1,0,0,1,0,1,0,0,0};
	cout << getSize(y) << endl;
	while (true){}
}
*/
vector<int> stov(string s)
{
	vector<int> v = {};
	for (char c : s)
	{
		v.push_back(c - '0');
	}
	return v;
}
void generate(const char*, std::string, const int, const int);

void genRow(long long l)
{
	int lenght = l;
	char str[] = { '0', '1'};
	int n = sizeof str;
	generate(str, "", n, lenght);
}
void generate(const char str[], std::string prefix, const int n, const int lenght)
{
	if (lenght == 1)
	{
		for (int j = 0; j < n; j++)
			if (getSize(stov(prefix + str[j])) == tolookfor)
			{
				good_bitti_jono = prefix + str[j];
				found = true;
				
			}
	}
	else
	{
		for (int i = 0; i < n; i++)
			generate(str, prefix + str[i], n, lenght - 1);
	}
}
int main()
{
	found = false;
	good_bitti_jono = "";
	long iterator = 1;
	cin >> tolookfor;
	while (found != true)
	{
		genRow(iterator);
		iterator++;
	}
	cout << good_bitti_jono << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 31

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 32

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 33

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 34

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 35

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 36

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 39

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED