Bittijono

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <bits/stdc++.h>

using namespace std;
 
// Returns count of distinct sunsequences of str.
int countSub(string str) {
    // Create an array to store index
    // of last
    vector<int> last(256, -1);
 
    // Length of input string
    int n = str.length();
 
    // dp[i] is going to store count of distinct
    // subsequences of length i.
    int dp[n + 1];
 
    // Empty substring has only one subsequence
    dp[0] = 1;
 
    // Traverse through all lengths from 1 to n.
    for (int i = 1; i <= n; i++) {
        // Number of subsequences with substring
        // str[0..i-1]
        dp[i] = 2 * dp[i - 1];
 
        // If current character has appeared
        // before, then remove all subsequences
        // ending with previous occurrence.
        if (last[str[i - 1]] != -1)
            dp[i] = dp[i] - dp[last[str[i - 1]]];
 
        // Mark occurrence of current character
        last[str[i - 1]] = (i - 1);
    }
 
    return dp[n];
}

string rev(string in) {
	string out;
	for (int i = in.size() - 1; i >= 0; i--) {
		out += in.at(i);
	}
	return out;
}

string getBin(int value) {
	string result;
	while (value >= 1) {
		if (value % 2 != 0) {
			result += '1';
		} else {
			result += '0';
		}
		value /= 2;
	}
	if (result.size() == 0) {
		result += '0';
	}
	result = rev(result);
	return result;
}

int main() {
	int number;
	cin >> number;
	int cur = 0;
	for (; countSub(getBin(cur)) != number; cur++) {
		cur++;
	}
	cout << getBin(cur + 1);
	//while (1);
	return 0;
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1

Verdict: WRONG ANSWER

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

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