CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Kurns
Submission time:2017-10-08 21:36:54 +0300
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1--1details
#2ACCEPTED0.06 s1details
#30.09 s1details
#4ACCEPTED0.07 s1details
#50.10 s1details
#60.08 s1details
#7ACCEPTED0.09 s1details
#80.12 s1details
#9ACCEPTED0.09 s1details
#100.82 s1details
#11ACCEPTED0.12 s2details
#12ACCEPTED0.09 s2details
#13ACCEPTED0.48 s2details
#140.09 s2details
#15ACCEPTED0.58 s2details
#16--2details
#17--2details
#18--2details
#19--2details
#20--2details
#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

Code

import itertools
import math

userInput = input()


def includes(userList, num): #Sisältääkö lista numeron?
    for c in range(0, len(userList)):
        if userList[c] == num:
            return True
    return False



def substrings(userString): #Palauttaa stringin substringien määrän
    found = [userString]
    for x in range(0, len(userString)):
        for h in range(0, len(list(itertools.combinations(userString, x)))):
            #print(list(itertools.combinations(userString, x))[h])
            if includes(found, list(itertools.combinations(userString, x))[h]) == False:
                found.append(list(itertools.combinations(userString, x))[h])
    return len(found)-1
    
#print(substrings("0110"))

def kbits(n, k): #n = lukujonon pituus, k = ykkösten määrä, generoi 01-jonoja
    result = []
    for bits in itertools.combinations(range(n), k):
        s = ['0'] * n
        for bit in bits:
            s[bit] = '1'
        result.append(''.join(s))
    return result

#print(kbits(4, 4))

def bittijono(montako):
    for k in range(1, 25):
        for j in range(0, math.floor(k/2)):
            for o in range(0, len(kbits(k,j))):
                #print(kbits(k,j)[o], "ja substringejä on", substrings(kbits(k,j)[o]))
                if substrings(kbits(k,j)[o]) == int(montako):
                    return kbits(k,j)[o]
                

print(bittijono(userInput))

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
(empty)

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
00

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
000

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
0000

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
00000

Test 6

Group: 1

Verdict:

input
6

correct output
101

user output
000000

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
00000000

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
0100

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
0000000000

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
0010100

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
00100

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
100100010

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
0110000

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
010011000

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
(empty)

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
(empty)

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
(empty)

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
(empty)

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
(empty)

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)