Bittijono

input/code.cpp: In function 'int main()':
input/code.cpp:204:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (last[sequence[i - 1]] != -1)
                                  ^

/*
#include <iostream>
#include <string>
 
using namespace std;
 
int main()
{
	string input = "";
	cin >> input;
 
	bool modifyDone = false, modified = false, deleteNext = false;
	string output = "";
	char lastChar = ' ';
	while (!modifyDone)
	{
		lastChar = ' ';
		output = "";
		deleteNext = false;
		modified = false;
		for (unsigned int i = 0; i < input.length(); i++)
		{
			if (i != 0)
			{
				if (input[i] == lastChar && (!modified || deleteNext))
				{
					if (!deleteNext)
					{
						output.pop_back();
						deleteNext = true;
						modified = true;
					}
				}
				else
				{
					deleteNext = false;
					output += input[i];
					lastChar = input[i];
				}
			}
			else
			{
				lastChar = input[i];
				output += input[i];
			}
		}
		if (!modified || output.length() <= 0)
		{
			modifyDone = true;
		}
		else
		{
			input = output;
		}
	}
	cout << output << "\n";
 
	int a;
	cin >> a;
 
	return 0;
}*/
//Teht�v� 1
 
/*
#include <iostream>
#include <string>
#include <math.h>
 
using namespace std;
 
int main()
{
unsigned int q = 0;
cin >> q;
 
string input[512];
string output[512];
input[0] = "#";
output[0] = "#";
 
for (unsigned int i = 2; i <= q; i++)
{
unsigned int power = pow(2, i - 1);
for (unsigned int o = 0; o < power / 2; o++)
{
output[o] = input[o] + input[o];
}
for (unsigned int o = power / 2; o < power; o++)
{
output[o] = input[o - (power / 2)];
for (unsigned int p = 0; p < power / 2; p++)
{
if (output[o][p] == '#')
{
output[o] += ".";
}
else
{
output[o] += "#";
}
}
}
for (unsigned int o = 0; o < output->size(); o++)
{
input[o] = output[o];
}
}
 
for (int i = 0; i < pow(2, q - 1); i++)
{
cout << output[i] << "\n";
}
 
int a;
cin >> a;
 
return 0;
}*/
//Teht�v� 2
 
/*
#include <iostream>
#include <string>
#include <math.h>
 
using namespace std;
 
int main()
{
	unsigned int q = 0;
	cin >> q;
	for (unsigned int i = 0; i < q; i++)
	{
		unsigned long long int k = 0;
		cin >> k;
 
		unsigned long long int a = 0;
		unsigned long long int gCeiled = 0;
 
		unsigned long long int result = 0;
 
		unsigned long long int o = 1;
		bool done = false;
		while (!done)
		{
			gCeiled += o * 9 * pow(10, o - 1);
			if (gCeiled > k)
			{
				a = o;
				done = true;
			}
			o++;
		}
 
		result = pow((unsigned long long int)10, a) - 1 - floor((gCeiled - k) / a);
 
		unsigned long long int mod = ((gCeiled - k) % a);
		string digits = to_string(result);
 
		cout << digits[digits.length() - mod - 1] << "\n";
	}
	int a = 0;
	cin >> a;
 
	return 0;
}*/
//Teht�v� 3
 
#include <iostream>
#include <string>
#include <vector>
#include <bitset>
//#include <bits/stdc++.h>
 
using namespace std;
 
const int MAX_CHAR = 256;
 
int main()
{
	unsigned long long int n = 0;
	cin >> n;
 
 
	unsigned long long int subCount = 0;
	unsigned long long int i = 1; 
	bitset<512> sequence(i);
	while (subCount < n)
	{
		i++;
		sequence = bitset<512>(i);
		vector<unsigned long long int>last(MAX_CHAR, -1);
 
		const unsigned long long int n = to_string(stoull(sequence.to_string())).length();
 
		unsigned long long int* dp = new unsigned long long int[n + 1];
		dp[0] = 1;
 
		for (unsigned long long int i = 1; i <= n; i++)
		{
			dp[i] = 2 * dp[i - 1];
 
			if (last[sequence[i - 1]] != -1)
			{
				dp[i] = dp[i] - dp[last[sequence[i - 1]]];
			}
 
			last[sequence[i - 1]] = (i - 1);
		}
		subCount = dp[n] - 1;
	}
		/*
		if (subCount < n && i == 0)
		{
			if (sequence.length() % 2 == 0)
			{
				sequence += "0";
			}
			else
			{
				sequence += "1";
			}
			vector<unsigned long long int>last(MAX_CHAR, -1);
 
			const unsigned long long int n = sequence.length();
 
			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;
 
			for (unsigned long long int i = 1; i <= n; i++)
			{
				dp[i] = 2 * dp[i - 1];
 
				if (last[sequence[i - 1]] != -1)
				{
					dp[i] = dp[i] - dp[last[sequence[i - 1]]];
				}
 
				last[sequence[i - 1]] = (i - 1);
			}
			subCount = dp[n] - 1;
		}
		else
		{
			unsigned long long int a = subCount - n + i;
			while (a < 0)
			{
				a += sequence.length();
			}
			while (a >= sequence.length())
			{
				a -= sequence.length();
			}
 
			if (sequence[a] == '0')
			{
				sequence[a] = '1';
			}
			else
			{
				sequence[a] = '0';
			}
 
			vector<unsigned long long int>last(MAX_CHAR, -1);
 
			const unsigned long long int n = sequence.length();
 
			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;
 
			for (unsigned long long int i = 1; i <= n; i++)
			{
				dp[i] = 2 * dp[i - 1];
 
				if (last[sequence[i - 1]] != -1)
				{
					dp[i] = dp[i] - dp[last[sequence[i - 1]]];
				}
 
				last[sequence[i - 1]] = (i - 1);
			}
			subCount = dp[n] - 1;
 
			i++;
		}
			*/
	cout << to_string(stoull(sequence.to_string())) << "\n";
 
	int a = 0;
	cin >> a;
	return 0;
}
//Teht�v� 4
 
/*
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <unordered_set>
 
using namespace std;
 
int main()
{
	string rows[10];
	for (int i = 0; i < 10; i++)
	{
		for (int o = 0; o < 10; o++)
		{
			int n = i + o;
			n = i + o;
			while (n > 9)
			{
				n -= 10;
			}
			rows[i] += to_string(n);
 
			if (i < 10 / 2)
			{
				n = o - i;
				while (n < 0)
				{
					n += 10;
				}
			}
			else
			{
				n = o - i + 1;
				while (n < 0)
				{
					n += 10;
				}
			}
 
			if (n == 0)
			{
				rows[i] += "A";
			}
			else if (n == 1)
			{
				rows[i] += "B";
			}
			else if (n == 2)
			{
				rows[i] += "C";
			}
			else if (n == 3)
			{
				rows[i] += "D";
			}
			else if (n == 4)
			{
				rows[i] += "E";
			}
			else if (n == 5)
			{
				rows[i] += "F";
			}
			else if (n == 6)
			{
				rows[i] += "G";
			}
			else if (n == 7)
			{
				rows[i] += "H";
			}
			else if (n == 8)
			{
				rows[i] += "I";
			}
			else if (n == 9)
			{
				rows[i] += "J";
			}
			if (o != 9)
			{
				rows[i] += " ";
			}
		}
		cout << rows[i] << "\n";
	}
 
	ofstream myfile;
	myfile.open("Eppapeli.txt");
	if (myfile.is_open())
	{
		for (int i = 0; i < 10; i++)
		{
			if (i != 10 - 1)
			{
				myfile << rows[i] + "\n";
			}
			else
			{
				myfile << rows[i];
			}
		}
		myfile.close();
	}
 
	int a;
	cin >> a;
 
	return 0;
}*/
//Teht�v� 5

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: WRONG ANSWER

Test 9

Group: 1

Verdict: WRONG ANSWER

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: WRONG ANSWER

Test 19

Group: 2

Verdict: WRONG ANSWER

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 3

Verdict: WRONG ANSWER

Test 22

Group: 3

Verdict: WRONG ANSWER

Test 23

Group: 3

Verdict: WRONG ANSWER

Test 24

Group: 3

Verdict: WRONG ANSWER

Test 25

Group: 3

Verdict: WRONG ANSWER

Test 26

Group: 3

Verdict: WRONG ANSWER

Test 27

Group: 3

Verdict: WRONG ANSWER

Test 28

Group: 3

Verdict: WRONG ANSWER

Test 29

Group: 3

Verdict: WRONG ANSWER

Test 30

Group: 3

Verdict: WRONG ANSWER

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