-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.py
More file actions
54 lines (39 loc) · 987 Bytes
/
Copy pathtest.py
File metadata and controls
54 lines (39 loc) · 987 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
# H, M = map(int, input().split())
# # 엠이 45이상일때는 엠 - 45
# # 엠이 45미만일때는
# # H = 0 h는 23이다
# # H-1 엠+15
# if M >= 45:
# print(H,M-45)
# elif M < 45:
# if H == 0 :
# print(23, M+15)
# else :
# print(H-1, M+15)
# H, M = map(int, input().split())
# if M > 44:
# print(H, M-45)
# elif M < 45:
# if H == 0:
# print(23, M+15)
# else:
# print(H-1, M+15)
# H, M = map(int, input().split())
# N = int(input())
# if M + N <= 60:
# print(H+1, M+N)
# elif M + N > 60:
# print(H+(M+N)//60,((M+N)//60)(M+N))
def solution1(cards1, cards2, goal):
answer = 'Yes'
c1 = 0
c2 = 0
for i in range(len(goal)):
if len(cards1) > c1 and cards1[c1] == goal[i]:
c1 += 1
elif len(cards2) > c2 and cards2[c2] == goal[i]:
c2 += 1
else:
answer = 'No'
break
return answer