Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions jaykxo/week01/11382_꼬마_정민.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
import sys
input = sys.stdin.readline

A, B, C = map(int, input().split())

print(A + B + C)
6 changes: 6 additions & 0 deletions jaykxo/week01/2438_별_찍기 - 1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
import sys
input = sys.stdin.readline
N = int(input())

for i in range(N):
print("*" * (i + 1))
21 changes: 21 additions & 0 deletions jaykxo/week02/10798_세로읽기.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
import sys
input = sys.stdin.readline

# 1) 5줄 입력받아 리스트에 저장
lines = []
for _ in range(5):
line = input().strip() # 한 줄 입력받고 개행 제거
lines.append(line)

# 2) 가장 긴 문자열의 길이 구하기
max_len = max(len(line) for line in lines)

# 3) 세로로 읽기: 열을 기준으로 각 줄을 돌며 문자 추가
result = ""
for c in range(max_len): # 열(column) 기준
for r in range(len(lines)): # 행(row) 기준
if c < len(lines[r]): # 해당 줄에 문자가 존재하면
result += lines[r][c]

# 4) 결과 문자열 출력
print(result)
14 changes: 14 additions & 0 deletions jaykxo/week02/10807_개수_세기.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
import sys
input = sys.stdin.readline

N = int(input()) # 숫자 개수 입력 받기
num = list(map(int, input().split())) # 숫자 리스트 입력 받기
v = int(input()) # 찾을 숫자 입력 받기

count = 0 # 찾은 숫자 개수 초기화

for i in range(N):
if num[i] == v : # 현재 숫자가 찾는 숫자와 같은지 확인
count += 1 # 같으면 개수 증가

print(count) # 결과 출력 (찾은 숫자의 개수)
8 changes: 8 additions & 0 deletions jaykxo/week02/10952_A+B-5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
import sys
input = sys.stdin.readline

while True:
a, b = map(int, input().split())
if a == 0 and b == 0: # 종료 조건
break
print(a + b)