CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:nokka7
Submission time:2017-10-15 18:01:02 +0300
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.07 s1details
#20.06 s1details
#30.08 s1details
#40.10 s1details
#5ACCEPTED0.12 s1details
#6ACCEPTED0.09 s1details
#70.09 s1details
#80.06 s1details
#90.10 s1details
#100.07 s1details
#110.08 s2details
#120.09 s2details
#130.09 s2details
#140.07 s2details
#150.06 s2details
#160.08 s2details
#170.10 s2details
#180.63 s2details
#190.80 s2details
#200.09 s2details
#210.07 s3details
#220.08 s3details
#230.08 s3details
#240.07 s3details
#250.08 s3details
#260.07 s3details
#270.07 s3details
#280.05 s3details
#290.08 s3details
#300.07 s3details
#310.06 s4details
#320.07 s4details
#330.06 s4details
#340.06 s4details
#350.07 s4details
#360.08 s4details
#370.08 s4details
#380.07 s4details
#390.07 s4details
#400.06 s4details

Code

#mjono = "0101"
#a = 0
#def osajoukot(jono):
  #  apumjono = ""
 #   for i in range(len(jono)):
#        apumjono = apumjono + jono[i]
#def haku(mjono, k):
    #if (k == len (mjono)):
     #   print(lista)
    #else:
   #     haku(mjono, k + 1)
  #      lista.append (mjono [k])
 #       haku(mjono, k + 1)
#        lista.remove (mjono[k])
#haku(input("Teksti:"), 1)
#ketju(5)
#b = 0
#while b < (1<<len(mjono)):
 #   if b == 10:
  #      print ("!")
   # else:
    #    continue
    #b +=1
luku = (input())
mjono = ""
lista = []
apumjono = ""
def haenta(mjono, k):
    global lista
    global apumjono
    if (k == (len(mjono))):
        if apumjono not in lista:
            lista.append (apumjono)
    else:
        haenta(mjono,(k+1))
        apumjono = apumjono + mjono[k]
        haenta(mjono, (k+1))
        apumjono = apumjono[0:-1]
    return str((len(lista)-1))
def binaaritus (sisalto):
    binaari = ""
    luku = sisalto
    while luku > 0:
        luku, bitti = divmod(luku, 2)           
        binaari = str(bitti) + binaari
    return binaari
for i in range (1, 2000):
    tama=str(binaaritus(i))
    if((haenta(tama, 0))<=luku):
        continue
    else:
        print (binaaritus(i))
        break

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
10

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
10

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
11

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
100

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:

input
7

correct output
1110

user output
101

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
110

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
111011

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
10

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
11

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
10

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
111100

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
10

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
110

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
1000000

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
10

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
1001101111

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
1001101010

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
111110

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
10

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
110

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
100

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
100

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
11

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
100

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
100

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
100

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
100

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
100

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
10

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
110

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
10

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
101

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
100

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
111110

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
111111

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
1000001

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
1000000

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
111101