Skip to content

1110 더하기 사이클 정재홍 #30

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
CHOCOCHANEL wants to merge 6 commits into
base: master
Choose a base branch
from
Open

1110 더하기 사이클 정재홍 #30

Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
297a512
17910 JointAttack 정재홍 - 어디가 틀린 걸까요ㅜㅜ
CHOCOCHANEL Apr 20, 2022
0ef2b38
1934 Least Common Multiplier Solved by using Greatest Common Divisor
CHOCOCHANEL Apr 21, 2022
9745b20
nothing on master
CHOCOCHANEL Apr 21, 2022
fc5d6d8
1110 Plus Cycle Solved
CHOCOCHANEL Apr 21, 2022
0dc5d34
1110 더하기 사이클 solved
CHOCOCHANEL Apr 24, 2022
671cc9b
test1021 branching initialized
CHOCOCHANEL Apr 24, 2022
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
28 changes: 28 additions & 0 deletions week1/1110더하기사이클/solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
def check(num):
num_str = num if isinstance(num, str) else str(num)

if len(num_str) < 2:
num_str = '0' + num_str

return num_str

def cal(num_str):
num_str = check(num_str)
temp_str = check(sum(list(map(int, num_str))))
return num_str[-1] + temp_str[-1]

N = int(input())
count = 0
init = check(N)
prev = N

while True:
count+=1
curr = cal(prev)
if count==1 and N==0:
break
if curr == init:
break
prev = curr

print(count)