티스토리 뷰

#Write your code below this line ?
def prime_checker(number):
    devided_number=[]
    count=0
    for check in range(1,number+1):
        if number%check == 0:
            count+=1
            devided_number.append(check)
    print(devided_number)
    if count==2:            #1 and itself
        print(f"Number \'{number}\' is a prime number.")
    else:
        print(f"Number \'{number}\' is Not a prime number.")
#Write your code above this line ?
#Do NOT change any of the code below?
n = int(input("Check this number: "))
prime_checker(number=n)
---------------------------------------------------------------------------
Check this number: 567
[1, 3, 7, 9, 21, 27, 63, 81, 189, 567]
Number '567' is Not a prime number.
Check this number: 97
[1, 97]
Number '97' is a prime number.

'Test > Python(20220101~)' 카테고리의 다른 글

Day8_Caesar 암호 2단계, decode  (0) 2022.01.10
Day8_Caesar 암호 1단계, encoding  (0) 2022.01.09
Day8_페인트 면적 계산 (Function)  (0) 2022.01.09
Day8_입력값이 있는 함수  (0) 2022.01.09
Day7_Hangman Game2  (0) 2022.01.08
댓글
공지사항
최근에 올라온 글
최근에 달린 댓글
Total
Today
Yesterday
링크
«   2025/08   »
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31
글 보관함