아기개발자의 개발이야기

a=[] for i in range(5): a.append(int(input())) print(sum(a))

print(" /~\\") print(" ( oo|") print(" _\\=/_") print(" / _ \\") print(" //|/.\\|\\\\") print(" || \\ / ||") print("============") print("| |") print("| |") print("| |")

while True: a,b=map(int, input().split()) if a+b==0: break if a>b: print("Yes") else: print("No")

summ = int(input()) a=[] for i in range(9): a.append(int(input())) print(summ-sum(a))

t= int(input()) for _ in range(t): n= list(input().split()) for i in n: print(i[::-1], end = " ")

n= int(input()) arr= [[0]*101 for k in range(101)] for _ in range(n): a,b=map(int,input().split()) for i in range(a,a+10): for j in range(b,b+10): arr[i][j]=1 answer=0 for x in arr: answer+=x.count(1) print(answer)

a=[] for _ in range(5): a.append(sum(list(map(int, input().split())))) print(a.index(max(a))+1,max(a))

print(bin(int(input(), 8))[2:])

n,m= map(int, input().split()) a=[] dp = [[0] * (m + 1) for _ in range(n + 1)] for _ in range(n): a.append(list(map(int, input().split()))) for p in range(1,n+1): for q in range(1, m+1): dp[p][q]= a[p-1][q-1]+dp[p-1][q]+dp[p][q-1]-dp[p-1][q-1] u=int(input()) for k in range(u): i,j,x,y=map(int, input().split()) print(dp[x][y]-dp[x][j-1]-dp[i-1][y]+dp[i-1][j-1])

k,n,m= map(int, input().split()) if k*n