지나가던 개발자

import math def is_prime(n): if n == 1: return False for i in range(2, int(math.sqrt(n))+1): if n % i == 0: return False return True n = int(input()) i = 2 ans = [] while True: if is_prime(i): ans.append(i) if len(ans) == 2: if ans[0]*ans[1] > n: print(ans[0]*ans[1]) break del ans[0] if i == 2: i += 1 continue i += 2

import math n = int(input()) A = list(map(int, input().split())) x = int(input()) sumDivide = [0, 0] for i in A: if math.gcd(i, x) == 1: sumDivide[0] += i sumDivide[1] += 1 print(sumDivide[0]/sumDivide[1])

[print(" ".join(list(map(str, x)))) for x in sorted([list(map(int, input().split())) for y in range(int(input()))])] 이왜진?이다... ㅋㅋㅋㅋ sorted()만으로 된다는 점에 놀랐다. 숏코딩 5등...! 이런 영예로운 기회를 얻다니...

from itertools import combinations import math for i in range(int(input())): m = list(map(int, input().split())) biggest = 0 for j in combinations(m, 2): if math.gcd(j[0], j[1]) > biggest: biggest = math.gcd(j[0], j[1]) print(biggest)

#include int main() { int n; int a = 1; scanf("%d", &n); for (int i=2; i*i

import math a, b = map(int, input().split()) print(math.lcm(a, b))

input() [print(x, end=" ") for x in sorted(list(map(int, input().split())))] 숏코딩 81위...!

import sys n, s = map(int,sys.stdin.readline().split()) cows = [int(sys.stdin.readline()) for x in range(n)] ans = 0 while True: try: i = cows[0] del cows[0] except: break for j in cows: if i + j