-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path22253.py
82 lines (48 loc) · 1.18 KB
/
22253.py
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
# PARTICIPANTE 1929 2227 2298 - -
# a,b,c,d = map(int, [2,5,9,3])
#
# if (a + b < c or a + b < d
# or c + b < d or c + b < a
# or d + b < c or d + b < a):
# print("S")
# else:
# print("N")
d = 0
a,v = map(int, [12, 3])
while True:
x, y = map(int, [2, 5])
if a == v == 0:
break
d = d+1
def test(list):
p = []
r = []
print(list)
for i in list:
if i not in list:
p.append(i)
r.append(1)
else:
r[p.index(i)] = r[p.index(i)]+1
print(p)
return p
test([2,2,5,4,8,6,55,5,5])
cartas = ["Ás", "2", "3", "4", "5", "6", "7", "8", "9", "10", "Valete", "Dama", "Rei"]
n = 1 # int(input())
p = 0
for i in range(n):
c1,c2,c3,c4,c5 = map(int, [12, 3, 10, 3, 12])
if c2 == c1 + 1 and c3 == c1 + 2 and c4 == c1 + 3 and c5 == c1 + 4:
p = c1 + 200
if c1 == c2 == c3 == c4 != c5:
p = c1 + 180
if c1 == c2 == c3 == c4 != c5:
p = c1 + 160
if c1 == c2 == c3 == c4 != c5:
p = c1 + 140
if c1 == c2 == c3 == c4 != c5:
p = 3 * x + 2 * y + 20
if c1 == c2 != c3 != c4 != c5:
p = c1
else:
p = 0