본문 바로가기

전체 글

(104)
[코드트리] 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 += ..
[코드트리] cnt 활용하기 배수의 개수 2https://www.codetree.ai/trails/complete/curated-cards/intro-number-of-multipliers-2/descriptioncnt = 0for _ in range(10): i = int(input()) if i % 2 != 0: cnt += 1print(cnt)    배수의 개수https://www.codetree.ai/trails/complete/curated-cards/challenge-number-of-multipliers/descriptioncnt3, cnt5 = 0, 0for _ in range(10): i = int(input()) if i % 3 == 0: cnt3 += 1 if ..
[코드트리] 반복문 안의 if 2 또는 3의 배수https://www.codetree.ai/missions/4/problems/multiple-of-2-or-3?&utm_source=clipboard&utm_medium=textn = int(input())for i in range(1, n+1): if i % 2 == 0 or i % 3 == 0: print(1, end=" ") else: print(0, end=" ")    100점 도달하기https://www.codetree.ai/missions/4/problems/reach-100-point?&utm_source=clipboard&utm_medium=textn = int(input())for i in range(n, 101): if i ..
[코드트리] if 안의 for 숫자의 증감https://www.codetree.ai/missions/4/problems/increasing-and-decreasing-numbers?&utm_source=clipboard&utm_medium=textarr = input().split()c,n = str(arr[0]), int(arr[1])if c == 'A': for n in range(1, n+1): print(n, end=" ")else: for n in range(n, 0, -1): print(n, end=" ")    높은 수에서 낮은 수까지https://www.codetree.ai/missions/4/problems/from-high-to-low?&utm_source=clipboard&utm..
[코드트리] n번 반복하기 문자 출력하기https://www.codetree.ai/missions/4/problems/print-text?&utm_source=clipboard&utm_medium=textw = input()for _ in range(8): print(w, end="")    문자열 출력하기https://www.codetree.ai/missions/4/problems/print-string?&utm_source=clipboard&utm_medium=textn = int(input())for _ in range(n): print("LeebrosCode")    a/b 출력https://www.codetree.ai/missions/4/problems/a-divide-b?&utm_source=clipboard..
[코드트리] while문 b → a 1씩 감소 감소시키며 출력하기 2https://www.codetree.ai/missions/4/problems/decrease-and-print-2?&utm_source=clipboard&utm_medium=texti = 26while i >= 10: print(i, end=" ") i -= 1    n부터 1까지 정수 출력https://www.codetree.ai/missions/4/problems/print-n-to-1?&utm_source=clipboard&utm_medium=textn = int(input())while n >= 1: print(n, end=" ") n -= 1      짝수만 출력 2https://www.codetree.ai/missions/4/problems/outp..