전체 글 (104) 썸네일형 리스트형 [코드트리] 행에 대해 대칭인 별 출력 별표 출력하기https://www.codetree.ai/trails/complete/curated-cards/intro-print-star/descriptionn = int(input())cnt = 1for i in range(n*2+1): for j in range(cnt): print("*", end=" ") print() if i 별표 출력하기 4https://www.codetree.ai/trails/complete/curated-cards/challenge-print-star-4/descriptionn = int(input())cnt=nfor i in range(n*2-1): for j in range(cnt): print("*", end=" .. [코드트리] 직각삼각형 별 출력 별표 출력하기 2https://www.codetree.ai/trails/complete/curated-cards/intro-print-star-2/descriptionn = int(input())for i in range(n): for _ in range(n-i): print("*", end=" ") print() 별표 출력하기 7https://www.codetree.ai/trails/complete/curated-cards/challenge-print-star-7/descriptionn = int(input())for i in range(n): for _ in range(i+1): print("*", end=" ") print() 별표 출력하기 .. [코드트리] 사각형 별 출력 정사각형 별표 출력하기https://www.codetree.ai/trails/complete/curated-cards/intro-print-stars-in-square/descriptionn = int(input())for _ in range(n): for _ in range(n): print("*", end="") print() 직사각형 별표 출력하기https://www.codetree.ai/trails/complete/curated-cards/challenge-print-stars-in-rectangle/descriptionarr = input().split()n = int(arr[0])m = int(arr[1])for _ in range(n): for _ in ra.. [코드트리] 모두 만족하는 경우 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.. 이전 1 2 3 4 5 ··· 13 다음
