n = 1
while n != 0:
n = int(input())
if n != 0:
print(n)
n = int(input())
while n != 0:
print(n)
n= n-1
n = int(input())
while n != 0:
print(n-1)
n= n-1
c = ord(input())
t = ord("a")
while t <= c:
print(chr(t),end=' ')
t+=1
n = int(input())
t = 0
while t <= n :
print(t)
t += 1
n = int(input())
for i in range(0, n+1):
print(i)
n = int(input())
sum = 0
for i in range(1, n+1):
if i % 2 == 0:
sum += i
print(sum)
while True:
n = input()
print(n)
if (n == 'q'):
break
오답.
다시 풀어보기
n = int(input())
s = 0
t = 0
while s < n:
t = t+1
s = s+t
print(t)
오답.
다시 풀어보기
n, m = map(int,input().split())
for i in range(1, n+1):
for j in range(1, m+1):
print(i,j)
n = int(input(),16)
for i in range(1, 16):
print("%x".upper()%n,"*","%x".upper()%i, "=", "%x".upper()%(n*i), sep="")
n = int(input())
for i in range(1, n+1):
if (i%10==3 or i%10==6 or i%10==9):
print("X", end=' ')
continue
print(i,end=' ')
오답.
3,6,9 게임이다.
3의 배수 아님.
r, g, b = map(int,input().split())
count=0
for i in range(r):
for j in range(g):
for k in range(b):
print('%d %d %d' %(i,j,k))
count = count + 1
print(count)
오답.
다시풀어보기
h, b, c, s = map(int, input().split())
print(format(h * b * c * s / 8 / 1024 / 1024, ".1f"), "MB")
w, h, b = map(int, input().split())
print(format(w * h * b / 8 / 1024 / 1024, ".2f"), "MB")
체력이슈로.. 이번엔 조금 적게..