Submission details
Task:Bittijono
Sender:suola_makkara
Submission time:2017-10-03 15:54:44 +0300
Language:C++
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
Test results
testverdicttimesubtask
#1ACCEPTED0.05 s1details
#20.03 s1details
#30.05 s1details
#40.04 s1details
#50.04 s1details
#60.05 s1details
#70.05 s1details
#80.05 s1details
#90.04 s1details
#100.04 s1details
#110.05 s2details
#120.05 s2details
#130.04 s2details
#140.05 s2details
#150.05 s2details
#160.04 s2details
#170.05 s2details
#180.04 s2details
#190.04 s2details
#200.04 s2details
#210.03 s3details
#220.05 s3details
#230.04 s3details
#240.04 s3details
#250.05 s3details
#260.04 s3details
#270.04 s3details
#280.06 s3details
#290.04 s3details
#300.04 s3details
#310.04 s4details
#320.05 s4details
#330.06 s4details
#340.05 s4details
#350.04 s4details
#360.05 s4details
#370.05 s4details
#380.05 s4details
#390.05 s4details
#400.04 s4details

Code

#include <iostream>
#include <string>
#include <set>
#include <bitset>

using namespace std;

int last(int x)
{
	if (x == 2)
	{
		return 2;
	}
	else if (x == 3)
	{
		return 1;
	}
	else if ((x & 1) == ((x >> 1) & 1))
	{
		return last(x >> 1);
	}
	else if ((x & 1) == 1)
	{
		return last((x - 1) >> 1) + last((x + 2) >> 1);
	}
	else
	{
		return last((x - 2) >> 1) + last((x + 1) >> 1);
	}
}

int subs(int x)
{
	int tot = 1;
	while (x > 1)
	{
		tot += last(x);
		x >>= 1;
	}
	return tot;
}

int find(int n)
{
	int i = 1;
	while (true)
	{
		if (subs(i) == n)
		{
			return i;
		}
		i++;
	}
}

void printBin(int x)
{
	string a = bitset<64>(x).to_string();
	while (a[0] == '0') a.erase(0, 1);
	cout << a << '\n';
}

int main()
{
	//int n;
	//cin >> n;
	//printBin(find(n));
	for (int i = 1; i < 11; i++)
	{
		printBin(find(i));
	}
	return 0;
}

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1
11
10
1111
100
...

Test 2

Subtask: 1

Verdict:

input
2

correct output
11

user output
1
11
10
1111
100
...

Test 3

Subtask: 1

Verdict:

input
3

correct output
10

user output
1
11
10
1111
100
...

Test 4

Subtask: 1

Verdict:

input
4

correct output
1111

user output
1
11
10
1111
100
...

Test 5

Subtask: 1

Verdict:

input
5

correct output
110

user output
1
11
10
1111
100
...

Test 6

Subtask: 1

Verdict:

input
6

correct output
101

user output
1
11
10
1111
100
...

Test 7

Subtask: 1

Verdict:

input
7

correct output
1110

user output
1
11
10
1111
100
...

Test 8

Subtask: 1

Verdict:

input
8

correct output
1100

user output
1
11
10
1111
100
...

Test 9

Subtask: 1

Verdict:

input
9

correct output
1101

user output
1
11
10
1111
100
...

Test 10

Subtask: 1

Verdict:

input
10

correct output
1001

user output
1
11
10
1111
100
...

Test 11

Subtask: 2

Verdict:

input
38

correct output
1101011

user output
1
11
10
1111
100
...

Test 12

Subtask: 2

Verdict:

input
13

correct output
11011

user output
1
11
10
1111
100
...

Test 13

Subtask: 2

Verdict:

input
90

correct output
111001010

user output
1
11
10
1111
100
...

Test 14

Subtask: 2

Verdict:

input
25

correct output
110010

user output
1
11
10
1111
100
...

Test 15

Subtask: 2

Verdict:

input
82

correct output
111001101

user output
1
11
10
1111
100
...

Test 16

Subtask: 2

Verdict:

input
94

correct output
1100011110

user output
1
11
10
1111
100
...

Test 17

Subtask: 2

Verdict:

input
100

correct output
1111001001

user output
1
11
10
1111
100
...

Test 18

Subtask: 2

Verdict:

input
99

correct output
110010010

user output
1
11
10
1111
100
...

Test 19

Subtask: 2

Verdict:

input
98

correct output
110110010

user output
1
11
10
1111
100
...

Test 20

Subtask: 2

Verdict:

input
92

correct output
100110001

user output
1
11
10
1111
100
...

Test 21

Subtask: 3

Verdict:

input
1666

correct output
101101100100101

user output
1
11
10
1111
100
...

Test 22

Subtask: 3

Verdict:

input
897

correct output
11101001101010

user output
1
11
10
1111
100
...

Test 23

Subtask: 3

Verdict:

input
4466

correct output
111101010110100101

user output
1
11
10
1111
100
...

Test 24

Subtask: 3

Verdict:

input
4240

correct output
11011001011010101

user output
1
11
10
1111
100
...

Test 25

Subtask: 3

Verdict:

input
3089

correct output
1011001010100101

user output
1
11
10
1111
100
...

Test 26

Subtask: 3

Verdict:

input
4697

correct output
11010101101010110

user output
1
11
10
1111
100
...

Test 27

Subtask: 3

Verdict:

input
4608

correct output
11010110101001010

user output
1
11
10
1111
100
...

Test 28

Subtask: 3

Verdict:

input
4625

correct output
111011001100101001

user output
1
11
10
1111
100
...

Test 29

Subtask: 3

Verdict:

input
4611

correct output
11010101010101100

user output
1
11
10
1111
100
...

Test 30

Subtask: 3

Verdict:

input
4917

correct output
10110100101010110

user output
1
11
10
1111
100
...

Test 31

Subtask: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
1
11
10
1111
100
...

Test 32

Subtask: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
1
11
10
1111
100
...

Test 33

Subtask: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
1
11
10
1111
100
...

Test 34

Subtask: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
1
11
10
1111
100
...

Test 35

Subtask: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
1
11
10
1111
100
...

Test 36

Subtask: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
1
11
10
1111
100
...

Test 37

Subtask: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
1
11
10
1111
100
...

Test 38

Subtask: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
1
11
10
1111
100
...

Test 39

Subtask: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
1
11
10
1111
100
...

Test 40

Subtask: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
1
11
10
1111
100
...