python-algorithm
백준 1235 학생 번호
무적김두칠
2022. 1. 1. 17:41
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
n=int(input())
studentList=[input() for i in range(n)]
numberLen=len(studentList[0])
# print(studentList)
# print(numberLen)
for i in range(1,numberLen+1):
compareList=[]
for j in range(n):
if studentList[j][numberLen-i:numberLen] in compareList: break
else:
compareList.append(studentList[j][numberLen-i:numberLen])
#print(compareList)
if len(compareList)==n:
print(i)
break
|
cs |
반응형