TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
p = list((input().split()))
s = list()
for i in range(1, len(p)):
    s.append(p[i])
print(len(list(set(s))))

import sys
p = []
for l in sys.stdin:
    a.append(l)
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(set(s)))

p = list((input().split()))
s = set()
for i in range(1, len(p)+1):
    s.add(p[i])
print(len(s))

import sys
p = []
for l in sys.stdin:
    a.append(int(l))
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(set(s)))

p = input() .split()
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(set(s)))

p = list((input().split()))
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(s))

import sys
a = []
for l in sys.stdin:
    a.append(l)
p = input() .split()
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(set(s)))

p = list((input().split()))
s = set()
for i in range(1, int(p[0])):
    s.add(p[i])
print(len(s))

import sys
s = sys.stdin.readlines()
s = input() .split()
for i in range(1, len(s)):
    s.add(p[i])
print(len(set(s)))

p = list((input().split()))
s = list()
for i in range(1, int(p[0])+1):
    s.append(p[i])
print(len(list(set(s))))

p = list((input().split()))
s = []
for i in range(1, int(p[0])):
    s.append(p[i])
print(len(list(set(s))))

p = list((input().split()))
s = set()
for i in range(1, int(p[0])):
    s.add(p[i])
print(len(list(s)))


n = int(input())
p = [input() for i in range(n)]
s = set()
for i in range(n):
    s.add(p[i])
print(len(s))

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
4
aaaa
a
aaa
aa


n=int(input())
s=[]
for i in range(n):
    s.append(input())
    
print(len(set(s)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
num = int(input())

if num>=1 and num<=200000:
  str_list = []
  kind = 0
  for idx in range(num):
    input_str = input()
    if input_str not in str_list:
      str_list.append(input_str)
      kind += 1
    else:
      pass

n = int(input())

l = []
for _ in range(n):
    l.append(input())
print(len(set(l)))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
list_S = []
for i in range(N):
  if not str(input()) in list_get: list_S.append(str(input()))
print(len(list_S))

N = int(input())
list_S = []
for i in range(N):
  list_S.append(str(input()))

list_get = []
for i in range(list_S):
  if not list_S[i] in list_get:
    list_get.append(list_S[i])

print(len(list_get))

N = int(input())
list_S = []
for i in range(N):
  list_S.append(input())

list_get = []
for i in list_S:
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

N = int(input())
list_S = []
for i in range(N):
  if not str(input()) in list_S: list_S.append(str(input()))
print(len(list_S))

N = int(input())
list_S = []
for i in range(N):
  if not str(input()) in list_get: list_S.append(str(input()))
print(len(list_get))

N = int(input())
list_S = []
for i in range(N):
  list_S.append(str(input()))

list_get = []
for i in range(list_S):
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

N = int(input())
list_S = []
for i in range(N):
  list_S.append(str(input()))

list_get = []
for i in list_S:
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

N = int(input())
list_S = [str(input()) for i in range(N)]
print(len(list(set(list_S))))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
count = 0

for i in range(n):
    s[i] = input()
    if s[i] in s:
        count += 1

print(count)



n = int(input())
s = [input() for _ in range(n)]

print(len(set(s)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys
from collections import deque
import copy
def main():
    N = int(input())
    S = []
    for i in range(N):
        s = input()
        if i == 0:
            S.append(s)
            continue
        for j in range(len(S)):
            flag = False
            if len(S[j]) != len(s):
                flag = True
                break
            else:
                for u in range(len(s)):
                    if S[j][u] != s[u]:
                        flag = True
                        break
            if flag:
                break
        if flag:
            S.append(s)
    print(len(S))
    

if __name__ == '__main__':
    main()


import sys
from collections import deque
import copy
def main():
    N = int(input())
    S = []
    for i in range(N):
        s = input()
        S.append(s)
    S.sort()
    count = N
    for i in range(1, len(S)):
        if S[i - 1] == S[i]:
            count -= 1
    print(count)
    

if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = []
for n in range(N):
    Sn = str(input())
    S.append(Sn)
print(S)
ans = len(list(dict.fromkeys(S)))
print(ans)

N = int(input())
S = []
for n in range(N):
    Sn = str(input())
    S.append(Sn)
ans = len(list(dict.fromkeys(S)))
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
# encoding="UTF-8"

N = int(input())
S = set()
for i in range(N):
    S.add(input())
print(S)
print(len(S))

# encoding="UTF-8"

N = int(input())
S = set()
for i in range(N):
    S.add(input())

print(len(S))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = input()
counter = 0
s = ""
temp = ""

while n > 0:
  s = input()
  if temp != s:
    counter = counter + 1
  temp = s
  n = n - 1

n = input()
counter = 0
s = ""
temp = ""

while n > 0:
  s = input()
  if temp != s:
    counter = counter + 1
  temp = s
  n = n - 1

print(counter)

n = int(input())
counter = 0
s = "TEMP"
temp = "TEMP"

while n > 0:
  s = input()
  if temp != s:
    counter = counter + 1
  temp = s
  n = n - 1

print(counter)


n = int(input())
counter = 0
s = "TEMP"
list = []

while n > 0:
  s = input()
  list.append(s)
  counter = 0
  for item in list:
    if item == s
      counter = counter - 1
    counter = counter + 1
  n = n - 1

print(counter)

n = input()
counter = 0
s = "TEMP"
temp = "TEMP"

while n > 0:
  s = input()
  if temp != s:
    counter = counter + 1
  temp = s
  n = n - 1

print(counter)

n = input()
counter = 0
s = "TEMP"
temp = "TEMP"

while n > 0:
  s = input()
  if temp != s:
    counter = counter + 1
  temp = s
  n = n - 1

n = int(input())
counter = 0
s = "TEMP"
list = []

while n > 0:
  s = input()
  list.append(s)
  counter = 0
  for item in list:
    if item == s:
      counter = counter - 1
    counter = counter + 1
  n = n - 1

print(counter)

n = int(input())
counter = 0
s = "TEMP"
list = []
temp = ''

while n > 0:
  s = input()
  list.append(s)
  n = n - 1

list.sort()
for item in list:
  if item == temp:
    counter = counter - 1
  counter = counter + 1
  temp = item

print(counter)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
ls = []
for x in range(n):
    ls.append(input())
    print(len(set(ls)))

n = int(input())
ls = []
for x in range(n):
    ls.append(input())
print(len(set(ls)))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
li = []
count = 0
for i in range(n):
    li.append(input())
li.sort()
print(li)
for i in range(n-1):
    if li[i] == li[i+1]:
        count += 1
print(n-count)

n = int(input())
li = []
count = 0
for i in range(n):
    li.append(input())
li.sort()
for i in range(n-1):
    if li[i] == li[i+1]:
        count += 1
print(n-count)

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
K = int(input())
L = []
for i in range(1,K+1):
    t =input()
    L.append(t)
print(len(L))

K = int(input())
L = []
for i in range(1,K+1):
    t =input()
    L.append(t)
S = set(L)
print(len(S))




Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
s = input().split()
print(len(set(s))-1)

N = int(input())
s = input().split()
print("\n")
print(len(set(s)))

N = int(input())
s = input().split()
print(len(set(s)))

N = int(input())
s = [input() for i in range(N)]
print(len(set(s)))

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())
 s= []
for _ in range(n):
    s.append(input())
count=0
for i in range(n):
    for j in range(i):
        if s[i]==s[j]:
            count=count
        else:
            count=count+1
print(count)

n = int(input())
s = [input() for i in range(n)]
print(len(set(s)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):

N = int(input())
S = []
count = 1
for i in range(N):
    S.append(input())

for i in range(N-1):
    if S[i] != S[i+1]:
        count+=1
print(count)

N = int(input())
S = []
count = 1


for i in range(N):
    S.append(input())
print(len(list(set(S))))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())

lis = []

for n in range(N):
  s = input()
  if not s in lis:
    s.append(s)

print(len(lis))

N = int(input())

lis = []

for n in range(N):
  lis.append(input())

s = set(lis)
print(len(s))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = set()
for i in range(n):
  s.insert(input())
print(len(s))

n = int(input())
s = set()
for i in range(n):
  s.add(input())
print(len(s))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
S=[]
for i in range(N):
    S.append(input())

for i in range(N):
    for j in range(N):
        if S[i] == S[j]:
            pair += 1

pair=(pair-N)/2
print(pair)


N=int(input())
S=[]
for i in range(N):
    S.append(input())

S=set(S)
print(len(S))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
    continue
  else: 
    c++
print(c)

N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
  else c++:
print(c)

N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
    continue
  else c++:
print(c)

N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]
  else c++
print(c)


N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
    continue
  else:
    c += 1
print(c)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = set()
for _ in range(n):
    string = input()
    s.add(string)
return len(s)    
    


n = int(input())
s = set()
for _ in range(n):
    string = input()
    s.add(string)
print(len(s))    
    


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
d = {}
for i in range(N):
  d[input()] = 0
print(len(dict))

N = int(input())
d = {}
for i in range(N):
    d[input()] = 0
print(len(d))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
num=int(input())
list=[]
for i in range(num):
  a=input()
  list.append(a)
b=set(a)
print(len(b))

num=int(input())
list=[]
for i in range(num):
  a=input()
  list.append(a)
b=set(list)
print(len(b))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import collections
N=int(input())
L=[input() for i in range(N)] 
C = collections.Counter(L)
D = list(C.values())
E=sum(D)
print(E)

import collections
N=int(input())
L=[input() for i in range(N)] 
C = collections.Counter(L)
D = list(C.values())
print(len(D))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import bisect
N = int(input())
ss = []
for i in range(N):
  ss.append(input())
  
ss.sort()
count = N
for i in range(N):
  index= bisect.bisect(ss,ss[i])
  if index == N:
    continue
  if ss[index] == ss[i]:
    count-= 1
    
print(count)


N = int(input())
ss = []
for i in range(N):
  ss.append(input())
  
print(len(set(ss)))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = [input() for i in range(n)]
len(set(s))

n = int(input())
s = [input() for i in range(n)]
len(set(s))

n = int(input())
s = [input() for i in range(n)]
print(len(set(s)))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
S_list = []
for i in range(N):
  s = str(input())
#  if not (s in S_list):
#    S_list.append(s)
print(len(S_list))

N=int(input())
S_list = []
for i in range(N):
  s = str(input())
  if not (s in S_list):
#    S_list.append(s)
print(len(S_list))

N=int(input())
S_list = []
count = 0
for i in range(N):
  s = str(input())
  S_list.append(s)
  if not (s in S_list):
    count = count + 1
print(len(S_list))

import numpy as np
N=int(input())
S_list = np.zeros(N)

e_list = "abcdefghijklmnopqrstuvwxyz"

for i in range(N):
  s = input()
  n = 0
  for k in range(len(s)):
    n = n + (e_list.index(s[k])+1)*(100**k)
  S_list[i] = n
print(len(np.unique(S_list)))


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.readline().strip()}

import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.readline().strip()}
print(len(items))

import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.stdin.readline().strip()}
print(len(items))


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(inout())
S=[input() for i in range(N)]
print(len(set(S)))

N=int(inout())
S=list(input() for i in range(N))
print(len(set(S)))


N = input()
List = list(input() for i in range(N))
print(len(set(List)))


N=int(input())
S=list(input() for i in range(N))
print(len(set(S)))


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = []

for i in range(N):
  S.append(input())
set(S)
print(len(S))

N = int(input())
S = []

for i in range(N):
  S.append(input())
S= set(S)
print(len(S))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())
a=[]
cnt=1
for i in range(n):
	a.append(input())
for i in range(0,n):
	for j in range(i+1,n):
		if a[i]==a[j]:
			break
		elif j == n-1:
			print('hi')
			cnt+=1
print(cnt)

n=int(input())
a=list(input() for i in range(n))
print(len(set(a)))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
a = []
for _ in n:
  a.append(input())
print(len(set(a)))  

n = int(input())
a = []
for _ in n:
  i = str(input())
  a.append(i)
print(len(set(a)))  

n = int(input())
print(len(set(list([input() for _ in range(n)])))) 

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
num=int(input())
lst=[]
if 1<=num<=2*10**5:
    lst=[input() for i in range(num)]
    print(lst)
    print(len(set(lst)))

import collections

num=int(input())
lst=[x for x in range(num)]
c=collections.Counter(lst)
print(len(c))

num=int(input())
lst=[]
if 1<=num<=2*10**5:
    lst=[input() for i in range(num)]
    print(len(set(lst)))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
port sys
import math
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
YES = lambda boolean: print('YES') if boolean else print('NO')
aint = lambda: int(input())
ints = lambda: list(map(int, input().split()))
is_even = lambda x: True if x%2==0 else False

n = aint()
get = []
for i in range(n):
  s = input()
  if s not in get:
    get.append(s)
print(len(get))

import sys
input = lambda: sys.stdin.readline().rstrip()
aint = lambda: int(input())
ints = lambda: list(map(int, input().split()))

n = aint()
get = [[],[],[],[],[],[],[],[],[],[]]
for i in range(n):
    s = input()
    if s not in get[len(s)-1]:
        get[len(s)-1].append(s)

ss = 0
for cont in get:
    ss += sum(cont)
print(ss)

import sys
import math
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
YES = lambda boolean: print('YES') if boolean else print('NO')
aint = lambda: int(input())
ints = lambda: list(map(int, input().split()))
is_even = lambda x: True if x%2==0 else False

n = aint()
get = []
for i in range(n):
    s = input()
    get.append(s)
ss = set(get)
print(len(ss))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = [input() for _ in range(N)]

S_set = list(set(S))



print(len(S))


N = int(input())
S = [input() for _ in range(N)]

S_set = list(set(S))



print(len(S_set))


Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = (input() for _ in range(n))
print(len(s))


n = int(input())
s = {input() for _ in range(n)}
print(len(s))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys 
sys.stdin = open('input.txt', 'r')  
sys.stdout = open('output.txt', 'w') 
t=int(input())
s=set()
for i in range(t):
    # n,m=map(int,input().split())
    n=input()
    s.add(n);
print(len(s));

    

 
t=int(input())
s=set()
for i in range(t):
    # n,m=map(int,input().split())
    n=input()
    s.add(n);
print(len(s));

    

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
items = []
count = 0
for x in range(N):
  thing = input()
  if not x in items:
    count += 1
  items.append(thing)
print(count)

N = int(input())
items = []
count = 0
for x in range(N):
  thing = input()
  if thing not x in items:
    count += 1
  	items.append(thing)
print(count)

N = int(input())
items = []
count = 0
for x in range(N):
  thing = input()
  if not x in items:
    count += 1
    items.append(thing)
print(count)

N = int(input())
items = []
count = 0
for x in range(N):
  thing = input()
  if thing is not in items:
    count += 1
  items.append(thing)
print(count)

N = int(input())
arr = []
for x in range(N):
  arr.append(input())

print(len(list(set(arr))))

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys
a = []
for l in sys.stdin:
    a.append(int(l))
a = a[1:]
print(len(set(a)))

hoge = input().split()
print(len(set(hoge)))

n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(len(set(data))-1)

from sys import stdin
import numpy as np
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(len(set(np.array(data).reshape(-1,))))

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
row = int(input())
item_list = [input() for i in range(row)]
result_list = []
for j in item_list:
  exist_in_item_list = False
  for k in result_list.len():
    if result_list[k] == item_list[j]:
      exist_in_item_list = True
      break
  if not exist_in_item_list:
    result_list.append(item_list[j])

print(result_list.len())


row = int(input())
item_list = [input() for i in range(row)]
result_list = []
for j in item_list:
  exist_in_item_list = False
  for k in result_list.len():
    if result_list[k] == item_list[j]:
      exist_in_item_list = True
      break
  result_list.append(item_list[j])

print(result_list.len())


row = int(input())
item_list = [input() for i in range(row)]
print(len(set(item_list)))


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
# coding:utf-8

n=int(input())
gacha_list[input() for i in range()]
gacha_prize=list(set(gacha_list())
print(len(gacha_prize()))

n=int(input())
a=[]
 
for i in range(n):
  word=input()
  a.append(word)
print(len(set(a)))




Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = [input() for _ in range(N)]

print(len(set(S))

N = int(input())
S = [input() for _ in range(N)]
 
print(len(set(S)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = [input(i) for i in range(N)]
#print(S)
ans=set(S)
print(len(ans))

N = int(input())
S = [input() for _ in range(N)]
#print(S)
ans=set(S)
print(len(ans))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
from collections import Counter
N = int(input())
S = list(input().split())
c = Counter(S)
print(len(c))

N = int(input())
S = set()
for i in range(N):
  S.add(input())
print(len(S))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys
import itertools

print(set(itertools.islice(sys.stdin.buffer, 1, None)))

import sys, itertools
print(len(set(itertools.islice(sys.stdin.buffer, 1, None))))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = [int(input()) for _ in range(n)]
print(len(set(s)))

n = int(input())
s = [input() for _ in range(n)]
print(len(set(s)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
newlst = []
lst =[]
m = int(input())
while(m<0):
    a = str(input())
    lst.append(a)
    m = m -1
for j in lst:
    if j not in newlst:
        newlst.append(j)
print(len(newlst))


newlst = []
lst =[]
m = int(input())
while m > 0:
    a = str(input())
    lst.append(a)
    m = m -1
newlst = list(dict.fromkeys(lst))
print(len(newlst))


Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
a, lists = int(input()), list(map(str, input().split()))
print(len(list(set(lists))))

x, lists, d = eval(input()), list(map(str, input().split())), {}
for item in lists:
   if item in d:
       d[item] += 1
   else:
       d[item] = 1
print(len(d))

x, lists, d = eval(input()), list(map(str, input().split())), {}
for item in lists:
   if item in d:
       d[item] += 1
   else:
       d[item] = 1
print(len(d))

a, lists = int(input()), []
for x in range(a):
    lists.append(input())
print(len(list(set(lists))))

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	C_fix
# CreatedDate:  2020-06-27 13:14:18 +0900
# LastModified: 2020-06-27 13:50:05 +0900
#


def main():
    n, m = map(int, input().split())
    h = list(map(int, input().split()))
    ma = [0]*n
    for _ in range(m):
        a, b = map(int, input().split())
        ma[a-1] = max(ma[a-1], h[b-1])
        ma[b-1] = max(ma[b-1], h[a-1])
#        print(ma)
    cnt = 0
    for i in range(n):
        if ma[i] < h[i]:
            cnt += 1
    print(cnt)




if __name__ == "__main__":
    main()


#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	C_fix
# CreatedDate:  2020-06-27 13:59:01 +0900
# LastModified: 2020-06-27 14:04:38 +0900
#


import os
import sys
# import numpy as np



def main():
    n = int(input())
    s = []
    for i in range(n):
        s.append(input())
    s = list(set(s))
    print(len(s))
        


if __name__ == "__main__":
    main()


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys

def main():

	N = int(input())
	
	d = {}
	for i in range(N):
		A = int(input())
		d[A] = 0
	print(len(d))
	
if __name__ == "__main__":
    main()

import sys

def main():

	N = int(input())
	
	d = {}
	for i in range(N):
		A = input()
		d[A] = 0
	print(len(d))
	
if __name__ == "__main__":
    main()

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n,m,q = map(int,input().split())
a = [0 for i in range(q)]
for i in range(q):
    a[i] = list(map(int,input().split()))
for i in range(1,m+1):
    for j in range(i,m+1):
        for k in range(j,m+1):
            for s in range(k,m+1):
                for p in range(s,m+1):
                    for l in range(p,m+1):
                        for e in range(l,m+1):
                            for u in range(e,m+1):
                                for v in range(u,m+1):
                                    b = [1,f,c,k,s,p,l,e,u,v]
                                    nn = 0
                                    for h in range(q):
                                        if b[a[h][1]-1] - b[a[h][0]-1] == a[h][2]:
                                            nn += a[h][3]
                                    ans = max(ans,nn)
print(ans)

N = int(input())
alist = a = [input() for i in range(N)]
alist.sort()
p = 0
for i in range(N-1):
    if alist[i] != alist[i+1]:
        p = p +1
print(p+1)

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())
s=input().split()
s=list(set(s))
print(len(s))

n=int(input())
s=[]
for i in range(n):
    s.append(input())
s=list(set(s))
print(len(s))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
S=[input() for _ in range(N)]
print(len(S))

N=int(input())
S=[input() for _ in range(N)]
print(len(S))

N=int(input())
S=[input() for _ in range(N)]
print(len(set(S)))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = {input().replace("\n","")}
print(len(S))

N = int(input())
Sn = []
for i in range(N):
    s = input()
    Sn.append(s)
print(len(set(Sn)))



Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
biki = {}
for i in range(N):
    S = input()
    biki.append(S)
print(len(biki))


N = int(input())
biki = []
bise = {}
for i in range(N):
    S = input()
    biki.append(S)
bise=set(biki)
print(len(bise))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
S = [input() for i in range(N) if input() not in S]
  
print(len(S))


N = int(input())
S = []
for i in range(N):
  S.append(input())

print(len(set(S)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
def gacha(sl):
    print(len(set(sl)))

n = int(input())
sl = []
for _ in range(n):
    sl.append(input())
print(sl)

gacha(sl)

def gacha(sl):
    print(len(set(sl)))

n = int(input())
sl = []
for _ in range(n):
    sl.append(input())
# print(sl)

gacha(sl)

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
set1 = set([])
for _ in range():
  s = input()
  set1.add(s)
 
print(len(set1))

n = int(input())
set1 = set([])
for _ in range(n):
  s = input()
  set1.add(s)
 
print(len(set1))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
def main(): 
    import sys
    from collections import defaultdict
    dic = defaultdict(int)

    input = sys.stdin.readline 

    s = str(input().rstrip())
    m = 0

    for i in range(1, len(s) + 1):
        m_1 = pow(10, i-1) % 2019
        m_add = (int(s[-i]) * m_1) % 2019
        m = (m_add + m) % 2019
        dic[m] += 1

    ans1 = 0

    for x in dic.values():
        if x > 1:
            ans1 += x * (x - 1) // 2
    ans2 = dic[0]

    print(ans1 + ans2)

if __name__ == "__main__":
    main()

def main():
    import sys
    from collections import Counter

    input = sys.stdin.readline

    n = int(input())
    s = [str(input()) for i in range(n)]
    co = Counter(s)
    print(len(co))

if __name__ == "__main__":
    main()

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
items = set()
for _ range(n):
  s = input()
  items.add(s)
print(len(items))

n = int(input())
items = set()
for _ in range(n):
  s = input()
  items.add(s)
print(len(items))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
count = 0
for _ in range(N):
    s = input()
    if not s in lst:
        count += 1
print(count)

N = int(input())
S = set()
count = 0
for _ in range(N):
    s = input()
    S.add(s)
print(len(S))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = []
s_append = s.append
for i in range(n):
    s_append(i)

print(len(set(s)))


n = int(input())
s = []
s_append = s.append
for i in range(n):
    s_append(input())

print(len(set(s)))


Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
SS=set()
while N=0:
  S=input()
  SS.add(S)
  N=N-1

N=int(input())
SS=set()
while N=0:
  S=input()
  SS.add(S)
  N=N-1
print(len(SS))

N=int(input())
SS=set()
while N=0:
  S=input()
  SS.add(S)
  N=N-1
print(len(SS))

N=int(input())
SS=set()
while N!=0:
  S=input()
  SS.add(S)
  N=N-1
print(len(SS))


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import collections
num = input()
a = [input() for i in range(num)]
clist = collections.Counter(a)
print(len(clist))

import collections
num = int(input())
a = input().split()
clist = collections.Counter(a)
print(len(clist))

import collections
a = input().strip().split()
number = a.pop(0)
clist = collections.Counter(a)
print(len(clist))

import collections
a = input().strip().split()
number = a.pop(0)
clist = collections.Counter(a)
print(len(clist))

import collections
num = int(input())
a = [input() for i in range(num)]
clist = collections.Counter(a)
print(len(clist))

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())
set={}
for n in range(n):
  set.append(input())
print(len(set))

n=int(input())
set_=set()
#print(set_)
for n in range(n):
  set_.add(input())
  #print(set_)
print(len(set_))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
def search(list, item):
  low = 0
  high = len(list) - 1
  while(low <= high):
    mid = (low + high) // 2
    guess = list[mid]
    if(guess == item):
      return mid
    if(guess > item):
      high = mid - 1
    else:
      low = mid + 1
  list.insert(low, item)
  print(list)
  return None

n = int(input())
item = []
for i in range(n):
  s = input()
  search(item, s)
print(len(item))
  



n = int(input())
item = set()
for i in range(n):
  s = input()
  item.add(s)
print(len(item))
  



Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import collections

N = int(input())

S_list = set(list(map(str,input().split())))
print(len(S_list))

N = int(input())

S_list = []
for i in range(N):
  S_list.append(input())
print(len(set(S_list)))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import random

N = int(input())
s = [input() for i in range(N)]
memo = []

for i in range(N):
    r = random.choice(s)
    if r not in memo:    
        memo.append(r)    

print(len(memo))    

N = int(input())
s = [input() for i in range(N)]
memo = []

for i in range(s):
    r = s.random.choice()
    if r not in memo:    
        memo.append(r)    

print(len(memo))    

N = int(input())
s = [input() for i in range(N)]

print(len(set(s)))    

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())

mydic={"",0}

for i in range(n):
    a=input()
    mydic.update(a)

print(mydic)
print(len(mydic)-2)

n=int(input())

li = []

for i in range(n):
    a=input()
    li.append((a,i))

di=dict(li)

#print(di)
print(len(di))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	# 
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- coding: utf-8 -*-
n = INT()
list = []

addFlag = True

for x in range(n):
    text = input()
    addFlag = True
    for y in list:
        if text == y:
            addFlag = False
            break
    if addFlag:
        list.append(text)
        
print(len(list))

import sys
import collections

n = int(sys.stdin.readline().strip())
data = []

for x in range(n):
    data.append(input())

print(len(collections.Counter(data)))

Verdicts: Time Limit Exceeded

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
s = [input() for i in range(n)]

ss = sorted(s)
test = ss[0]
count = 1

for i in range(n):
  if test != s[i]:
    test = s[i]
    count += 1
    
print(count)

n = int(input())
s = [input() for i in range(n)]

ss = sorted(s)
test = ss[0]
count = 1

for i in range(n):
  if test != ss[i]:
    test = ss[i]
    count += 1
    
print(count)

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))
a=set(A)
print(len(a))

N=int(input())
A=[]
A.append(int(input()))
a=set(A)
print(len(a))

n=int(input())
s=[]
for _ in range(n):
  s.append(input())
s=set(s)
print(len(s))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
l = []
for i in range(N):
    l.append(int(input()))
print(len(set(l)))


N = int(input())
l = [input() for i in range(N)]
print(len(set(l)))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=int(input())
s=[input() for _ in range(n)]

print(len(type(s)))

from collections import Counter
N = int(input())
S = []
while True:
    S.append(input())

print(len(Counter(S)))

N = int(input())
S = []
while True:
    S.append(input())

print(len(Counter(S)))

n=int(input())
s={input() for _ in range(n)}

print(len(s))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())

ans = {}
for i in range(N):
    ans.add(input())

print(len(ans))

N = int(input())

ans = set()
for i in range(N):
    ans.add(input())

print(len(ans))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N = int(input())
ga = []
for _ in range(N):
    ga.append(input())
print(len(ga))

N = int(input())
ga = []
for _ in range(N):
    ga.append(input())
ga = set(ga)
print(len(ga))

Verdicts: Wrong Answer

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
N=int(input())
list=[]
for i in N:
  list.append(input())
  
print(len(list))  

N=int(input())
list=[]
for i in range(N):
  list.append(input())
  
print(len(list))  

N=int(input())
glist=[]
for i in range(N):
  glist.append(input())

print(lens(glist))  
  
  

n=int(input())
s=[]
for i in range(N):
  s.append(input())
  
print(len(set(s)))  

N=int(input())
glist=[]
for i in range(N):
  glist.append(input())
  
  
print(len(set(glist)))  

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):




#include <algorithm>

using namespace std;


int main() {
	    int a,b;
	    cin>>a;
	    std::unordered_set<string> s;
	    
	    while(a--){
	        string str;
	        cin>>str;
	        string key=str;
	        	if (!(s.find(key) != s.end())){
	        	    s.insert(str); 
	        	}
	    }
	    cout<< s.size()<<endl;
	return 0;
}




#include <algorithm>

using namespace std;


int main() {
	    int a,b;
	    cin>>a;vector<string> colour;
	    
	    while(a--){
	        string str;
	        cin>>str;
	        string key=str;
	        	if (!(std::find(colour.begin(), colour.end(), key) != colour.end())){
	        	    colour.push_back(str); 
	        	}
	    }
	    cout<< colour.size()<<endl;
	return 0;
}





#include <algorithm>

using namespace std;
int main() {
	    int a;
	    cin>>a;
	    unordered_set<string> s;
	    while(a--){
	        string  str;
	        cin>>str;
	        string key=str;
	        	if (!(s.find(key) != s.end())){
	        	    s.insert(str); 
	        	}
	    }
	    cout<< s.size()<<endl;
	return 0;
}

list1 =[]
number = int(input())
for i in range(0,number):    
    numbers = input()
    list1.append(numbers)
setOfMarks=set(list1)
print(len(setOfMarks))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n=iinput())
s=list()
for i in range(n):
 s.append(input())
print(len(set(s)))

n=int(input())
s=list()
for i in range(n):
 s.append(input())
print(len(set(s)))

Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
# -*- coding: utf-8 -*-

A, B, C, D = map(int, input().split())

#s = input()
#print(s[0:K-1]+s[K-1].lower()+s[K:N])

while(1):
    C = C-B
    if C <= 0:
        print("Yes")
        break
    A = A-D
    if A <= 0:
        print("No")
        break


# -*- coding: utf-8 -*-

#N, K = map(int, input().split())
N = int(input())
list = []

for i in range(N):
    s = input()
    list.append(s)
    #if not s in list:
        #list.append(s)

#print(list)
print(len(set(list)))


Verdicts: Runtime Error

Accepted
Problem: You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.  How many kinds of items did you get?

Submission attempts (in order):
n = int(input())
list = {}
for x in range(n):
	item = input()
	list[item] = x
print(len(lest))

n = int(input())
list = {}
for x in range(n):
	item = input()
	list[item] = x
print(len(list))


Verdicts: Runtime Error

Accepted