Programming Kindergarten

https://www.acmicpc.net/problem/1316 N = int(input())count = 0for _ in range(N): S = input() l = [-1] * 26 for idx in range(0, len(S)): if l[(ord(S[idx]) - 97)] == -1: l[(ord(S[idx]) - 97)] = idx else: if l[(ord(S[idx]) - 97)] == idx - 1: l[(ord(S[idx]) - 97)] = idx else: count += 1 breakprint(N ..

l = ["c=", "c-", "dz=", "d-", "lj", "nj", "s=", "z="]S = input()c = 0for w in l: c += S.count(w)print(len(S) - c)https://www.acmicpc.net/problem/2941

N, M = map(int, input().split(" "))l = [i + 1 for i in range(N)]for _ in range(M): i, j = map(int, input().split(" ")) for idx in range(i, j): if i https://www.acmicpc.net/problem/10811 reversed 내장 함수 사용하면 될 듯