[SW][BEAKJOON]/[SW][BEAKJOON][반복문] (14) 썸네일형 리스트형 [BEAKJOON][반복문][15552][Python] 빠른 A+B PROBLEM - Link Approach to the problem - Code import sys T = int(input()) for i in range(T): a,b = map(int, sys.stdin.readline().split()) print(a+b) End - [BEAKJOON][반복문][2739][Python] 구구단 PROBLEM - Link Approach to the problem - Code # 구구단 만들기 # 입력 : 숫자 (1~9) # 출력 : 구구단 출력 N = int(input()) for i in range(1,10) : print(N, "*", i, "=", N*i) End - [BEAKJOON][반복문][11021][Python] A+B - 7 PROBLEM - Link Approach to the problem - Code import sys T = int(input()) # ReadLine 활용 for i in range(T): a,b = map(int, sys.stdin.readline().split()) print("Case #" + str(T+1) + ":" , a+b) # --- # 그냥 일반적인 Code T = int(input()) for i in range(1, T+1): A, B = map(int, input().split()) print("Case #" + str(i) + ":", A+B) End - [BEAKJOON][반복문][2741][Python] N 찍기 PROBLEM - Link Approach to the problem - comprehension 코드 [print(i) for i in range(1, int(input())+1)] Code n = int(input()) for i in range(n): print(i+1) End - 이전 1 2 다음