CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Katajisto
Submission time:2017-10-05 23:06:52 +0300
Language:C++
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.05 s2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.15 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.17 s2details
#16ACCEPTED0.43 s2details
#17ACCEPTED0.42 s2details
#18ACCEPTED0.15 s2details
#19ACCEPTED0.15 s2details
#20ACCEPTED0.17 s2details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details
#31--4details
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

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++)
                                               ^

Code

#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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
11

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
10

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
1111

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
110

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
1110

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
1100

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
1101

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
1101011

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
11011

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
111001010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
110010

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
111001101

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1100011110

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1111001001

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
110010010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
110110010

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100110001

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
(empty)

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
(empty)

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
(empty)

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
(empty)

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
(empty)

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
(empty)

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
(empty)

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)