선릉역 1번 출구

1. 1978 cnt = 0 a = int(input()) prime = input().split() prime_ten = [2, 3, 5 ,7] for i in range(a): if int(prime[i]) in prime_ten: cnt += 0 elif int(prime[i]) % 2 == 0: cnt += 1 else: if (int(prime[i])**(1/2)) % 1 == 0: cnt +=1 else: for j in range(2,int(int(prime[i])**(1/2))+1): if int(prime[i]) % j == 0: cnt += 1 break print(len(prime)-cnt) #소수를 판별하려면 그 수(n)를 루트(n)까지 나눠보면 된다. 그리고 2로 나눠지는 수는 2..

1. 1712 A, B, C = map(int, input().split()) i = 1 if B >= C: print(-1) else: print(A // (C - B) + 1) 2. 2292 num = int(input()) count = 2 start = 7 while True: if num == 1: count = 1 print(1) break if num/start nums_bee: nums_bee += 6 * count count += 1 print(count) 3. 1193 num = int(input()) cnt = 1 fract = 1 flag = 1 prev = 0 while num > fract: prev = fract fract += (cnt + 1) cnt += 1 flag = -..

1. 11654 print(ord(input())) 2. 11720 a = int(input()) b = input() sum = 0 for i in range(a): sum += int(b[i]) print(sum) a = int(input()) b = input() print(sum([int(i) for i in b])) 3. 10809 ls = [-1] * 26 word = input() for i in range(len(word)): if ls[ord(word[i])-97] == -1: ls[ord(word[i])-97] = i for i in range(26): print("{} ".format(ls[i]), end="") // print(f'{a[i]} ',end='') 4. 2675 for ..

1. 15596 def solve(a:list) -> int: return sum(a) 2. 4673 def selfnum(): a = [0]*10001 for j in range(1,10001): if(a[j] == 0): //self_num인지 check! print(j) //먼저 self_num 숫자 출력 self_num = j while self_num