QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #773513 | #9578. 爱上字典 | laonongmin# | RE | 8ms | 10772kb | Python3 | 294b | 2024-11-23 09:12:21 | 2024-11-23 09:12:29 |
Judging History
answer
s = input().lower().split()
s = [ss.strip('.').strip('!').strip(',').strip('?') for ss in s]
# print(s)
n = int(input())
ans = len(s)
lst = []
for i in range(n):
lst.append(input().lower())
# print(tmp)
lst = list(set(lst))
for pp in lst:
ans -= s.count(pp)
print(ans)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 8ms
memory: 10772kb
input:
I love Liaoning. Love Dalian! 1 love
output:
3
result:
ok single line: '3'
Test #2:
score: -100
Dangerous Syscalls
input:
Sulfox Loves Furry! Fur fur Furred. 2 anthropomorphic furry