CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:FSMnArmosta
Submission time:2017-10-02 23:08:57 +0300
Language:Haskell
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.05 s2details
#12ACCEPTED0.03 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.03 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.04 s2details
#17ACCEPTED0.04 s2details
#18ACCEPTED0.04 s2details
#19ACCEPTED0.05 s2details
#20ACCEPTED0.04 s2details
#210.05 s3details
#220.04 s3details
#230.05 s3details
#240.05 s3details
#250.04 s3details
#260.04 s3details
#270.04 s3details
#280.06 s3details
#290.05 s3details
#300.06 s3details
#310.06 s4details
#320.06 s4details
#330.06 s4details
#340.04 s4details
#350.05 s4details
#360.06 s4details
#370.03 s4details
#380.03 s4details
#390.05 s4details
#400.05 s4details

Code

{-

Inspiraatiota luntin taulun muodostukseen, komentokieli python3; teknisesti vielä haskellin kielinen palautus

from itertools import combinations
  2 
  3 def number(chain):
  4     q = 0
  5     for i in range(1, len(chain)+1):
  6         q += len(set(["".join(x) for x in combinations(chain, i)]))
  7     return q
  8 
  9 
 10 d = {}
 11 for l in range(1, 11):
 12     for i in range(2**l):
 13         bitstring = "0".join(format(i, str(l)+"b").split(" "))
 14         n = number(bitstring)
 15         if not n in d.keys():
 16             d[n] = bitstring
 17 
 18 print('"'.join(str(list([d[x] for x in range(1,101)])).split("'")))


-}

main :: IO ()
main = do
    num <- getLine
    let luntinTaulu = ["0", "00", "01", "0000", "001", "010", "0001", "0011", "0010", "0110", "0101", "00010", "00100", "01110", "00110", "00101", "01001", "011110", "01010", "000110", "000101", "001100", "001011", "001001", "001101", "0000101", "001010", "010010", "010110", "0001011", "0001001", "010101", "0001101", "0011101", "0001010", "00001100", "0100010", "0010100", "0010010", "00100001", "0010110", "0011010", "0110110", "0100110", "0010101", "00011011", "0100101", "0101001", "00010100", "00010010", "00011001", "001111101", "0101010", "00100100", "00011010", "00110011", "00111010", "00010101", "00101100", "01001110", "00100110", "00110110", "00101011", "01010001", "00100101", "00101101", "00101001", "01100110", "00110101", "001000100", "01001101", "01101001", "01011001", "00101010", "000111010", "000101100", "01001010", "01011010", "01010110", "001011100", "000101011", "000110010", "000100101", "001100010", "000101101", "000101001", "01010101", "0000111001", "001010001", "000110101", "001001011", "011001110", "001110101", "0011100001", "000101010", "001010011", "001100110", "001001101", "001101101", "0000110110"]

    putStrLn (luntinTaulu!!((read num)-1))

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
0

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
00

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
01

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
0000

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
001

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
010

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
0001

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
0011

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
0010

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
0110

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
000110101

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
001101

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
000110010

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
0011100001

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
0000110110

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
001101101

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
001001101

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
011001110

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
(empty)

Error:
code: Prelude.(!!): index too large

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)

Error:
code: Prelude.(!!): index too large