📑 Double or One

Codejam 1A Round 2022. Task 1

Python Only

T=int(input())
for t in range(T):
    S=input()
    NS=''; i=0; temp=''
    while i < len(S)-1:
        if (len(set(S[i:])) == 1) and (len(S[i:]) > 1):
            NS+=S[i:-1]
            break
        else:
            if S[i+1] > S[i]:
                NS+=2*temp+2*S[i]
                temp=''
            elif S[i+1] < S[i]:
                NS+=temp+S[i]
                temp=''
            else:
                temp+=S[i]
        i+=1  
    print('Case #{}: {}'.format(t+1,NS+S[-1]))

def gen_first(S):
    i=0; temp=''
    while i < len(S)-1:
        if (len(set(S[i:])) == 1) and (len(S[i:]) > 1):
            yield S[i:-1]
            break
        else:
            if S[i+1] > S[i]:
                yield 2*temp+2*S[i]
                temp=''
            elif S[i+1] < S[i]:
                yield temp+S[i]
                temp=''
            else:
                temp+=S[i]
        i+=1
    yield S[-1]
T=int(input())
for t in range(T):
    S=input()
    NS=''.join(gen_first(S))
    print('Case #{}: {}'.format(t+1,NS))

xxxxxxxxxx

 

1

@interact

2

def twice_ones(

3

    T=[1,2,3],

4

    S=input_box('PEEL\nAAAAAAAAAA\nCODEJAMDAY',

5

                 type=str,label='S',width=20,height=3)):

6

    S=str(S).split('\n'); s=S[T-1]

7

    print('input: ',s)

8

    ns=''; i=0; temp=''

9

    while i < len(s)-1:

10

        if (len(set(s[i:])) == 1) and (len(s[i:]) > 1):

11

            ns+=s[i:-1]

12

            break

13

        else:

14

            if s[i+1] > s[i]:

15

                ns+=2*temp+2*s[i]

16

                temp=''

17

            elif s[i+1] < s[i]:

18

                ns+=temp+s[i]

19

                temp=''

20

            else:

21

                temp+=s[i]

22

        i+=1  

23

    print('Case #{}: {}'.format(T,ns+s[-1]))

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

---

Messages