CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:SeveriK
Submission time:2017-10-05 22:35:10 +0300
Language:C++
Status:READY
Result:49
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#3ACCEPTED27
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.04 s2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.06 s2details
#15ACCEPTED0.06 s2details
#16ACCEPTED0.06 s2details
#17ACCEPTED0.05 s2details
#18ACCEPTED0.05 s2details
#19ACCEPTED0.06 s2details
#20ACCEPTED0.06 s2details
#21ACCEPTED0.07 s3details
#22ACCEPTED0.06 s3details
#23ACCEPTED0.20 s3details
#24ACCEPTED0.13 s3details
#25ACCEPTED0.11 s3details
#26ACCEPTED0.10 s3details
#27ACCEPTED0.11 s3details
#28ACCEPTED0.17 s3details
#29ACCEPTED0.15 s3details
#30ACCEPTED0.10 s3details
#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 'int main()':
input/code.cpp:205:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (last[sequence[i - 1]] != -1)
                                  ^

Code

/*
#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>
using namespace std;

const int MAX_CHAR = 64;
const int SEQUENCE_BITS = 64;

int main()
{
	unsigned int k = 0;
	cin >> k;

	unsigned int subCount = 0;
	unsigned int i = 0;
	bitset<SEQUENCE_BITS> bitSequence(i);
	string sequence = to_string(i);
	while (subCount != k)
	{
		i++;
		bitSequence = bitset<SEQUENCE_BITS>(i);
		sequence = to_string(stoull(bitSequence.to_string()));

		vector<unsigned int>last(MAX_CHAR, -1);

		const unsigned int n = sequence.length();

		unsigned int* dp = new unsigned int[n + 1];
		dp[0] = 1;

		for (unsigned 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;
	}
	cout << sequence << "\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 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
100

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
1000

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
1011

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
100100010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
101100

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
100010011

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1000011100

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1001001111

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
100011010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
100111010

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100011001

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
100100010101010

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
10100010110100

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
101001001110001011

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
10101011010011011

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1010010101001101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
10010101001010100

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
10101101010010100

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
100010101110110110

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
10101101011010100

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10010101011010010

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)