Problem:


Score : 300 points

Problem Statement

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?

Constraints

1 \leq N \leq 2\times 10^5

S_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print the number of kinds of items you got.

Sample Input 1

3
apple
orange
apple

Sample Output 1

2

You got two kinds of items: apple and orange.

Sample Input 2

5
grape
grape
grape
grape
grape

Sample Output 2

1

Sample Input 3

4
aaaa
a
aaa
aa

Sample Output 3

4



Sample input:
3
apple
orange
apple


Sample output:
2

Submission status: Accepted

Solution code:
N = int(input())
S = set()

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

print(len(S))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    items = set()
    for _ in range(N):
        S = input()
        items.add(S)
    print(len(items))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
N = int(input())
s = set()

for _ in range(N):
    S = input()
    s.add(S)

print(len(s))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


N = int(input())
keihin = [input().rstrip() for _ in range(N)]

counter = Counter(keihin)
print(len(counter))

Submission status: Accepted

Solution code:
N = int(input())
Syouhinlist = [input() for i in range(N)]

#sum = 0

Syouhinlist = set(Syouhinlist)
print(len(Syouhinlist))


#for i in range(len(Syouhinlist)):
#    if Syouhinlist.count(Syouhinlist[i]) >= 2 :
#        sum = sum + 1

    
#print(Syouhinlist[i])
#print(sum)


#print(Syouhinlist)

Submission status: Accepted

Solution code:
t = int(input())
ans = []
while t:
  s = input()
  ans.append(s)
  t = t - 1
ans = set(ans)
print(len(ans))

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
arr = []

for i in range(n):
    arr.append(input())

arr = set(arr)

print(len(arr))

Submission status: Accepted

Solution code:
N = int(input())
items = set()
for n in range(0, N):
  items.add(input())
print(len(items))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = list(set([ input() for _ in range(n)]))

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
S=set([input() for i in range(n)])
print(len(S))

Submission status: Accepted

Solution code:
import collections

N = int(input())
S = [input() for _ in range(N)] #入力からリストを作成
C = collections.Counter(S) #各要素ごとに集計

print(len(C))

Submission status: Accepted

Solution code:
N = int(input())

goods = {}
for i in range(N):
  name = input().rstrip()
  if name in goods.keys():
    goods[name] += 1
  else:
    goods[name] = 1
print(len(goods.keys()))

Submission status: Accepted

Solution code:
N = int(input())

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

print(len(set(S)),end='\n')

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())
dict = {}
for i in range(N):
    my_item = raw_input()
    dict[my_item] = 1
print(len(dict))

Submission status: Accepted

Solution code:
import collections

n = int(input())
s = [str(input()) for _ in range(n)]
c = collections.Counter(s)
print(len(c.values()))

Submission status: Accepted

Solution code:
n = int(input())
li_s = list()
for _ in range(n):
    li_s.append(input())
print(len(set(li_s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = []
for i in range(0,n):
    a.append(input())
a.sort()
count = 1
for i in range(1,len(a)):
    if a[i] != a[i-1]:
        count = count + 1
print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

# print(s)
print(len(set(s)))

Submission status: Accepted

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

print(len(kind))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = {}
for _ in range(N):
    A[input()] = 1
print(len(A))

Submission status: Accepted

Solution code:
n = int(input())
source = []
for x in range(n):
  source.append(input())
itemset = set()
items = 0
for x in range(n):
  if source[x] not in itemset:
    items += 1
    itemset.add(source[x])
print(items)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S = [str(input()) for i in range(N)]
print(len(set(S)))

Submission status: Accepted

Solution code:
N = int(input())
S = {input() for i in range(N)}
print(len(S))

Submission status: Accepted

Solution code:
n = int(input())

lot = {}
for i in range(n):
  lot[input()] = 0
  
print(len(lot))

Submission status: Accepted

Solution code:
print(len({input() for i in range(int(input()))}))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

N = int(input())
S = [input() for _ in range(N)]
count = collections.Counter(S)

print(len(count))

Submission status: Accepted

Solution code:
import collections

N =int(input())

s = [input() for i in range(N)]   #複数行の文字のリスト
c = collections.Counter(s)
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
L = set([input() for _ in range(N)])
print(len(L))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(len(set([input() for i in range(int(input()))])))

Submission status: Accepted

Solution code:
n=int(input())
gift=[]
for i in range(n):
    gift.append(input())
seted_gift=list(set(gift))
print(len(seted_gift))

Submission status: Accepted

Solution code:
N=int(input())
ans=len(set([input() for _ in range(N)]))
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

K2 = set(K)

print("{}".format(len(K2)))

Submission status: Accepted

Solution code:
def main4():
	N = int(input())
	S = []
	for _ in range(N):
		S.append(input())
	S_ = set(S)
	print(len(S_))

main4()

Submission status: Accepted

Solution code:
N = int(input())
S = []
for _ in range(N):
    S.append(input())
#2-3-1. 最初にすべて読み込む必要がある場合 - 行列、グリッド

print(len(set(S)))

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())
d=set()
for i in range(0,n):
    a=str(input())
    d.add(a)
print(len(d))

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from collections import defaultdict
import math
from queue import Queue

d = defaultdict(int)

n = int(stdin.readline().strip())

for _ in range(n):
    d[stdin.readline().strip()] += 1

stdout.writelines(str(len(d))+'\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
sequence = [input() for _ in range(n)]

print(len(set(sequence)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=set()
for i in range(n) :
    c=input()
    a.add(c)
print(len(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s=[input() for i in range(n)]
s.sort()
count=1
for i in range(n-1):
  if(s[i]!=s[i+1]):
    count+=1
    
print(count)

Submission status: Accepted

Solution code:
n=int(input())
p=set((input() for x in [0]*n))
print(len(p))

Submission status: Accepted

Solution code:
N = int(input())
S = []

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

Submission status: Accepted

Solution code:
n = int(input())
my_set = set([]) 

for _ in range(0, n): 
  my_set.add(str(input()))
 
print(len(my_set))

Submission status: Accepted

Solution code:
N = int(input())
st = set()
for _ in range(N):
    st.add(input())
print(len(st))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
n = int(input())
List = []
for i in range(n):
    tmp = input()
    List.append(tmp)
cnt_list = list(collections.Counter(List))
print(len(cnt_list))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():
    # 入力
    N = int(input())
    item_set = set()
    for i in range(N):
        item_set.add(input())

    print(len(item_set))


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

n = int(input().strip())
ss = []
for _ in range(n):
      ss.append(input().strip())

ss = np.array(ss)
print(len(np.unique(ss)))

Submission status: Accepted

Solution code:
#C
N = int(input())
Si = []
for k in range(N):
    Si.append(input())

Si = set(Si)
print(len(Si))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

import sys
input = sys.stdin.readline

N = int(input())
A = [input().rstrip() for _ in range(N)]
ans = len(set(A))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = [input() for i in range(n)]
print(len(set(a)))

Submission status: Accepted

Solution code:
N = int(input())
A = [input() for _ in range(N)]
print(len(list(set(A))))

Submission status: Accepted

Solution code:
print(len(set([input() for i in range(int(input()))] )))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())
S = []
for i in range(N):
  S.append(input())
print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
print(len(set(input() for n in range(N))))

Submission status: Accepted

Solution code:
n = int(input())
"""
N個の連続する文字列の標準入力
"""
s = [input() for i in range(n)]
"""
set(l) lに含まれるユニークな文字列を抽出
"""
print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in range(N)]
dict = {}
for i in range(N):
    if S[i] not in dict:
        dict[S[i]] = 1
print(len(dict))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S={}
for i in range(N):
    tmp=input()
    if (tmp in S):
        S[tmp]+=1
    else:
        S[tmp]=1
# print(S)
print(len(S))

Submission status: Accepted

Solution code:
t = int(input())
s = [input() for i in range(t)]
print(len(set(s)))

Submission status: Accepted

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

print(len(set(s)))

Submission status: Accepted

Solution code:
N = int(input())

S = set()

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

print(len(S))

Submission status: Accepted

Solution code:
import collections
n = int(input())
s = [input() for i in range(n)]

c = collections.Counter(s)
print(len(c))

Submission status: Accepted

Solution code:
N = int(input())
List = [str(input()) for i in range(N)] 
print(len(list(set(List))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

A = set()

for i in range(N):
    A.add(input())

print(len(A))

Submission status: Accepted

Solution code:
from collections import Counter

N, *S = open(0)

C = Counter(S)
print(len(C.keys()))

Submission status: Accepted

Solution code:
import collections
N = int(input())
a = [input() for i in range(N)]
c = collections.Counter(a)
print(len(c.keys()))

Submission status: Accepted

Solution code:
n = int(input())
st = set()
cnt = 0
for _ in range(n):
  s = input()
  st.add(s)
print(len(st))

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    N = read_int()
    items = set()
    for _ in range(N):
        items.add(input().strip())
    return len(items)


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
N = int(input())

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

print(len(items))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print(len(set(input() for _ in range(n))))

Submission status: Accepted

Solution code:
order = int(input())
data = set([])

for i in range(order):
    data.add(input())

print(len(data))

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
N=int(input())
K=[]
z=0
for x in range(N):
    k=input()
    K.append(k)
T=set(K)
y=len(T)
print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
// Author : snape_here - Susanta Mukherjee
     
 """
 
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())
 
 
def read():
    sys.stdin = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(a , b):
    return (a*b)//gcd(a,b)

mod=1000000007

import math

import bisect

abc="abcdefghijklmnopqrstuvwxyz"

def main():

    l=[]
    for _ in range(ii()):
        s=si()
        l.append(s)
    print(len(set(l)))

# region fastio

 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n = int(input())
    s = [input() for _ in range(n)]

    has = set()
    for s_i in s:
        if s_i not in has:
            has.add(s_i)
    print(len(has))

Submission status: Accepted

Solution code:
from collections import*
n,*a=open(0).read().split()

print(len(Counter(a).values()))

Submission status: Accepted

Solution code:
N = int(input())
S=[]
for _ in range(N):
   S.append(input())
ans = set(S)
print(len(ans))

Submission status: Accepted

Solution code:
n = int(input())
get = [input() for i in range(n)]
print(len(set(get)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
def input_number():
    return int(input())

def input_1line_list(number_of_input):
    return [input() for i in range(number_of_input)]

def print_unique_length(input_list):
    print(len(set(input_list)))

def main():
    n = input_number()
    print_unique_length(input_1line_list(n))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = int(input().strip())
ans = set()
for _ in range(n):
	s = input().strip()
	ans.add(s)

print(len(ans))

Submission status: Accepted

Solution code:
N = int(input())

l = []
for n in range(N):
    i = input()
    l.append(i)


newl = list(set(l))
print(len(newl))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
l = [input() for _ in range(N)]
l = set(l)
print(len(l))

Submission status: Accepted

Solution code:
t = int(input())
l = []
while t!= 0:
    a = input()
    l.append(a)
    t = t - 1
print(len(set(l)))

Submission status: Accepted

Solution code:
x = int(input())
y = []
result = []

for i in range(x):
  y.append(input())
  
print(len(set(y)))

Submission status: Accepted

Solution code:
N = int(input())

S = [input() for i in range(N)]
S = set(S)

print(len(S))

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

N = I()
S = [0]*N
for i in range(N):
    S[i] = str(input())

print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    n = int(input())
    ans = set()

    for i in range(n):
        si = input()
        ans.add(si)

    print(len(ans))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(len({input() for i in range(int(input()))}))

Submission status: Accepted

Solution code:
N=int(input())
S={input() for i in range(N)}
print(len(S))

Submission status: Accepted

Solution code:
n=int(input())
ss=[input() for _ in range(n)]
print(len(set(ss)))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = int(input())
    s = [input() for i in range(n)]
    print(len(set(s)))

Submission status: Accepted

Solution code:
#ABC164C
def main():
    import sys
    N = int(sys.stdin.readline())
    presents = set()
    for _ in range(N):
        presents.add(sys.stdin.readline().rstrip())
    print(len(presents))




if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
keihin_dict = {}
for i in range(n):
	keihin = input()
	keihin_dict.setdefault(keihin, 1)
print(len(keihin_dict	))

Submission status: Accepted

Solution code:
n=int(input())
from collections import Counter
cc=Counter()
for _ in range(n):
    s=input()
    cc[s]+=1
print(len(cc))

Submission status: Accepted

Solution code:
n = int(input())
array = list(input() for i in range(n))

array = set(array)

len = len(array)

print(len)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

count = int(input())
line = list()
for i in range(count):
    syurui = input()
    line.append(syurui)
    
line2 = set(line)
print(len(line2))

Submission status: Accepted

Solution code:
N = int(input())
S = []

for _ in range(N):
    temp = input()
    S.append(temp)

print(len(set(S)))

Submission status: Accepted

Solution code:
n=int(input())

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

a=set(a)
print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ls = list(input() for i in range(n))
print(len(set(ls)))

Submission status: Accepted

Solution code:
n = int(input())
ls = list(input() for i in range(n))
set_ls = set(ls)
print(len(set_ls))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = [input() for _ in range(n)]
m = list(set(s))
print(len(m))

Submission status: Accepted

Solution code:
a=int(input())
b=[input() for i in range(a)]
def func(b):
    return len(set(b))
print(func(b))

Submission status: Accepted

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}
ipnl = lambda n: [input() for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]
mp = lambda :map(int,input().split())

n = inp()
x = ipnl(n)
print(len(set(x)))

Submission status: Accepted

Solution code:
#C

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

a = set(a)
print(len(a))

Submission status: Accepted

Solution code:
n = int(input())
list1 = []
for x in range(n):
  a = input()
  list1.append(a)
print(len(set(list1)))

Submission status: Accepted

Solution code:
N,*S = open(0)
print(len(set(S)))

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in [0] *N]
print(len(set(S)))

Submission status: Accepted

Solution code:
N = int(input())

S = [input() for i in range(N)]

S = list(set(S))

print(len(S))

Submission status: Accepted

Solution code:
N = int(input())
d = [0]*N
for i in range(N):
  d[i] = input()

print(len(set(d)))

Submission status: Accepted

Solution code:
n = int(input())
dictionary = {}
for i in range(n):
  s = input()
  dictionary[s] = "get"

print(len(dictionary))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S = []
for _ in range(N):
    S.append(input())

S.sort()
dupli = 0
for i in range(N-1):
    if S[i] == S[i+1]:
        dupli += 1

print(N - dupli)

Submission status: Accepted

Solution code:
num = int(input())
count = num
lists = []
for i in range(num):
    lists.append(input())
print(len(set(lists)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

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

c = collections.Counter(S)

print(len(c))

Submission status: Accepted

Solution code:
n = int(input())
s = set()
for _ in range(n):
    s.add(input())

print(len(s))

Submission status: Accepted

Solution code:
# @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-27 11:02
# @url:https://atcoder.jp/contests/abc164/tasks/abc164_c
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
# region fastio

BUFSIZE = 8192

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
def main():
    t=int(input())
    strlist=[str(input()) for x in range(t)]
    # print ([str(x) for x in strlist])
    ans=set()
    for s in strlist:
        ans.add(s)
    print (len(ans))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
print(len({input() for i in range(N)}))

Submission status: Accepted

Solution code:
a=[input() for _ in range(int(input()))]
print(len(set(a)))

Submission status: Accepted

Solution code:
N = int(input())
l = []
for i in range(N):
    l.append(input())
l = sorted(l)
new_list = []
new_list.append(l[0])
for i in range(1,len(l)):
    if l[i-1] != l[i]:
        new_list.append(l[i])
print(len(new_list))

Submission status: Accepted

Solution code:
import collections
# N = int(input())
# n = [str(input()) for i in range(N)]
# Counter = collections.Counter(n)
# print(len(Counter.values()))
N = int(input())
S = set([str(input()) for i in range(N)])
print(len(S))

Submission status: Accepted

Solution code:
def gacha():
    N = int(input())

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

    print(len(items))

gacha()

Submission status: Accepted

Solution code:
import collections
N = int(input())
S = []
for i in range(N):
    S.append(input())
c = collections.Counter(S)
print(len(c))

Submission status: Accepted

Solution code:
N=int(input())
ans=[]
for i in range(N):
    ans.append(input())
ans_l=set(ans)

print(len(ans_l))

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
n = int(input())
s=[]
ans = 1
for i in range(n):
    s += [input()]
s.sort()
for i in range(n-1):
    if s[i] != s[i+1]:
        ans += 1
print(ans)

Submission status: Accepted

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