코딩테스트/프로그래밍 기초 | 단순 반복문 (18) 썸네일형 리스트형 [코드트리] 모두 만족하는 경우 ab 사이에 없는 chttps://www.codetree.ai/trails/complete/curated-cards/intro-c-between-a-and-b-2/descriptionarr = input().split()a,b,c = int(arr[0]), int(arr[1]), int(arr[2])satisfied = Truefor i in range(a, b+1): if i % c == 0: satisfied = Falseif satisfied == True: print("YES")else: print("NO") 소수 판별기https://www.codetree.ai/trails/complete/curated-cards/challenge-prime-number-disc.. [코드트리] 단 하나라도 만족하는 경우 ab 사이에 있는 chttps://www.codetree.ai/trails/complete/curated-cards/intro-c-between-a-and-b/descriptionarr = input().split()a,b,c = int(arr[0]), int(arr[1]), int(arr[2])satisfied = Falsefor i in range(a, b+1): if i % c == 0: satisfied = Trueif satisfied == True: print("YES")else: print("NO") 합성수 판별기https://www.codetree.ai/trails/complete/curated-cards/challenge-factorization-disc.. [코드트리] 언제 끝날지 모르는 상황에서의 loop 3N + 1 수열https://www.codetree.ai/trails/complete/curated-cards/intro-3n-plus-1-sequence/descriptionn = int(input())cnt = 0while True: if n == 1: break if n % 2 == 0: n = n // 2 cnt += 1 else: n = n * 3 + 1 cnt += 1print(cnt) 출력결과 3https://www.codetree.ai/trails/complete/curated-cards/challenge-reading-k201521/description1 출력결과 77https://www.c.. [코드트리] Infinite Loop 0 나올 때까지 출력https://www.codetree.ai/trails/complete/curated-cards/intro-print-until-zero-is-given/descriptionwhile True: i = int(input()) if i == 0: break print(i) 특정 수 맞히기https://www.codetree.ai/trails/complete/curated-cards/challenge-catching-specific-number/descriptionwhile True: i = int(input()) if i == 25: s = "Good" print(s) break elif i .. [코드트리] break문 1부터의 합https://www.codetree.ai/trails/complete/curated-cards/intro-sum-from-the-one/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ain = int(input())sum = 0for i in range(1, 101, 1): sum += i if.. [코드트리] continue문 친근하지 않은 수https://www.codetree.ai/trails/complete/curated-cards/intro-unfriendly-number/descriptionn = int(input())cnt = 0for i in range(1,n+1): if (i % 2 == 0) or (i % 3 == 0) or (i % 5 == 0): continue cnt += 1print(cnt) 특정 조건의 온전수 구하기https://www.codetree.ai/trails/complete/curated-cards/challenge-print-onjeonsu/descriptionn = int(input())for i in range(1, n+1): if (i % 2 .. [코드트리] prod 계산하기 주어진 수까지의 곱https://www.codetree.ai/trails/complete/curated-cards/intro-multiplication-up-to-a-given-number/descriptionarr = input().split()a,b = int(arr[0]), int(arr[1])prod = 1for i in range(a, b+1): prod *= iprint(prod) a의 b승https://www.codetree.ai/trails/complete/curated-cards/challenge-a-to-the-power-of-b/descriptionarr = input().split()a,b = int(arr[0]), int(arr[1])prod = 1for _ in ran.. [코드트리] sum 계산하기 a부터 b까지의 합https://www.codetree.ai/trails/complete/curated-cards/intro-sum-from-a-to-b/descriptioni = input().split()a,b = int(i[0]), int(i[1])sum_val = 0for i in range(a, b+1): sum_val += iprint(sum_val) 100부터 입력받는 수까지의 합https://www.codetree.ai/trails/complete/curated-cards/challenge-sum-of-the-number-input-from-100/descriptionn = int(input())sum_val=0for i in range(n, 101): sum_val += .. 이전 1 2 3 다음
