📑 Farewell Round A 2023 Task 1 Colliding Encoding

Farewell Round A 2023. Task 1

Python Only

T=int(input())
letters='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for t in range(T):
    D=input().replace(' ','')
    N=int(input())
    numbers=set()
    words=set()
    for i in range(N):
        w=input()
        words.update([w])
        n=''.join([D[letters.find(s)] for s in w])
        numbers.update([n])
    if len(numbers) < len(words):
        print('Case #{}: YES'.format(t+1))
    else:
        print('Case #{}: NO'.format(t+1))
        

xxxxxxxxxx

 

1

@interact

2

def colliding_encoding(

3

    T=selector([1,2],default=1,label='$\\mathbb{T}$'),

4

    D=input_box('0 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n'+\

5

                '0 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3',

6

                type=str,label='$\\mathbb{D}$',width=50,height=3),

7

    N=input_box('4|3',type=str,label='$\\mathbb{N}$',width=50),

8

    W=input_box('ABC BC BCD CDE|CDE DEF EFG',

9

                type=str,label='$\\mathbb{W}$',width=50)):

10

    letters='ABCDEFGHIJKLMNOPQRSTUVWXYZ'

11

    numbers=set(); words=set()

12

    DS=str(D).split('\n')[T-1]

13

    DS=DS.replace(' ','')

14

    N=int(str(N).split('|')[T-1])

15

    WS=(str(W).split('|')[T-1]).split()

16

    pretty_print([T,DS,N,WS])

17

    for i in range(N):

18

        w=WS[i]

19

        words.update([w])

20

        n=''.join([DS[letters.find(s)] for s in w])

21

        numbers.update([n])

22

    if len(numbers) < len(words):

23

        pretty_print('Case #{}: YES'.format(T))

24

    else:

25

        pretty_print('Case #{}: NO'.format(T))

Language: Sage Gap GP HTML Macaulay2 Maxima Octave Python R Singular

---

Messages