CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Nanohenry
Submission time:2017-10-09 22:18:22 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#20.06 s1details
#30.06 s1details
#40.05 s1details
#50.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.05 s1details
#80.04 s1details
#90.04 s1details
#100.04 s1details
#110.06 s2details
#120.05 s2details
#130.06 s2details
#140.06 s2details
#150.05 s2details
#160.06 s2details
#170.05 s2details
#180.04 s2details
#190.06 s2details
#200.06 s2details
#210.05 s3details
#220.06 s3details
#230.05 s3details
#240.07 s3details
#250.06 s3details
#260.05 s3details
#270.05 s3details
#280.06 s3details
#290.07 s3details
#300.04 s3details
#310.04 s4details
#320.05 s4details
#330.04 s4details
#340.04 s4details
#350.05 s4details
#360.04 s4details
#370.06 s4details
#380.04 s4details
#390.05 s4details
#400.06 s4details

Code

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>

// Contains FIBONACCI!

using namespace std;

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 getFibonacci(int n) { // With recursion
	if (n < 2) {
		return n;
	}
	return getFibonacci(n - 1) + getFibonacci(n - 2);
}*/

int getFibonacci(int n) { // Without recursion
	if (n <= 1) {
		return n;
	}
	int f = 1;
	int prev = 1;
	for (int i = 2; i < n; i++) {
		int temp = f;
		f += prev;
		prev = temp;
	}
	return f;
}

int main() {
	int number;
	cin >> number;
	cout << getBin(getFibonacci(number - 1));
	//while (1);
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
0

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
1

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
1

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
10

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
11

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:

input
8

correct output
1100

user output
1101

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
10101

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
100010

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
1011100001001111001111001

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
10010000

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
11110011101111101111011001101

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
1011010100100000

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
0

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
100010000111110010011100000010

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
0

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
0

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
0

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
0

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
0

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
101101000001010110110001100010...

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
101111000101010110101101010000...

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
0

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
0

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
110010000011110110110101011

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
0

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
100101110000001100101111101101...

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
0

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
0

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
0

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
110100011010000001101010010001...

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
11111001010000001001000111101

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
0

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
111010010101100000001111011010...

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
0

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
0

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
1110110111000011011111011101

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
0

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
110010011111111101000011010001...