Submission #1766979
Source Code Expand
# 好き, 嫌い,
# 好き, 嫌い, 大好き
n = int(input())
petals = list(map(int, input().split()))
two = [0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
three = [0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0]
ls = []
for i in range(10):
ls.append(two[i] + three[i])
num = 0
for petal in petals:
if ls[petal] != 0:
i = 0
while ls[petal - i] != 0:
i += 1
num += 1
print(num)
Submission Info
Submission Time |
|
Task |
B - 花占い |
User |
semaPhoretic |
Language |
Python (3.4.3) |
Score |
100 |
Code Size |
429 Byte |
Status |
AC |
Exec Time |
18 ms |
Memory |
3064 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, test_1.txt, test_112358.txt, test_1379137913.txt, test_1414213562.txt, test_1732151817.txt, test_2.txt, test_2236167977.txt, test_2645751311.txt, test_3.txt, test_3141592653.txt, test_4.txt, test_5.txt, test_6.txt, test_6666666666.txt, test_7.txt, test_73.txt, test_8.txt, test_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
17 ms |
3064 KB |
sample_02.txt |
AC |
17 ms |
3064 KB |
test_1.txt |
AC |
17 ms |
3060 KB |
test_112358.txt |
AC |
17 ms |
3060 KB |
test_1379137913.txt |
AC |
17 ms |
3064 KB |
test_1414213562.txt |
AC |
17 ms |
3064 KB |
test_1732151817.txt |
AC |
17 ms |
3064 KB |
test_2.txt |
AC |
18 ms |
3064 KB |
test_2236167977.txt |
AC |
18 ms |
3060 KB |
test_2645751311.txt |
AC |
18 ms |
3064 KB |
test_3.txt |
AC |
17 ms |
3060 KB |
test_3141592653.txt |
AC |
18 ms |
3064 KB |
test_4.txt |
AC |
18 ms |
3064 KB |
test_5.txt |
AC |
17 ms |
3064 KB |
test_6.txt |
AC |
18 ms |
3064 KB |
test_6666666666.txt |
AC |
18 ms |
3064 KB |
test_7.txt |
AC |
17 ms |
3064 KB |
test_73.txt |
AC |
17 ms |
3060 KB |
test_8.txt |
AC |
18 ms |
3064 KB |
test_9.txt |
AC |
17 ms |
3064 KB |