Submission #164529

#TimeUsernameProblemLanguageResultExecution timeMemory
164529boolodifjenulaProgramiranje (COCI17_programiranje)Cpython 3
24 / 80
3058 ms4084 KiB
s=input() Q=int(input()) O=[] for i in range (Q): A,B,C,D=map(int,input().split()) X=s[A-1:B] Y=s[C-1:D] for j in range(B-A+1): t=0 for c in range(B-A+1): if c==len(Y): break if Y[c]==X[j]: Y=Y[:c]+Y[c+1:] t=1 break if t==0: O+=["NE"] break if t: O+=["DA"] for i in range(Q): print(O[i])
#Verdict Execution timeMemoryGrader output
Fetching results...