잉?

https://codeup.kr/problem.php?id=1279 1279 : 홀수는 더하고 짝수는 빼고 1 a, b = map(int, input().split()) result = 0 for i in range(a, b+1): if i % 2 == 0: result -= i else: result += i print(result)

https://codeup.kr/problem.php?id=1278 1278 : 자릿수 계산 # 1 n = int(input()) result = 1 count = 0 while result < n: result *= 10 count += 1 print(count) # 2 n = int(input()) print(len(str(n)))

https://codeup.kr/problem.php?id=1276 1276 : 팩토리얼 계산 n = int(input()) fac = 1 for i in range(1, n+1): fac *= i print(fac)

https://codeup.kr/problem.php?id=1275 1275 : k 제곱 구하기 n, k = map(int, input().split()) mul = 1 for i in range(1, k+1): if k == 0: mul = '1' break mul *= n print(mul)

https://codeup.kr/problem.php?id=1274 1274 : 소수 판별 # 1 n = int(input()) count = 0 for i in range(2, n+1): if n % i == 0: count += 1 if count > 2: print('not prime') else: print('prime') # 2 n = int(input()) now = 'prime' for i in range(2, n): if n % i == 0: now = 'not prime' break print(now)

https://codeup.kr/problem.php?id=1273 1273 : 약수 구하기 n = int(input()) for i in range(1, n+1): if n % i == 0: print(i, end = ' ')

https://codeup.kr/problem.php?id=1271 1271 : 최대값 구하기 # 1 n = int(input()) nData = list(map(int, input().split())) print(max(nData)) # 2 n = int(input()) nData = list(map(int, input().split())) maxNumber = 0 for i in nData: if i > maxNumber: maxNumber = i print(maxNumber)

https://codeup.kr/problem.php?id=1270 1270 : 1의 개수는? 1 n = int(input()) count = 0 for i in range(1, n+1): if i % 10 == 1: count += 1 print(count)