문제 링크입니다: https://www.acmicpc.net/problem/6975
6975번: Deficient, Perfect, and Abundant
Write a program that repeatedly reads a positive integer, determines if the integer is deficient, perfect, or abundant, and outputs the number along with its classification. A positive integer, n, is said to be perfect if the sum of its proper diviso
www.acmicpc.net
간단한 구현 문제였습니다.
개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
| 백준 7510번 고급 수학 (0) | 2021.06.05 |
|---|---|
| 백준 7015번 Millennium (0) | 2021.06.04 |
| 백준 6794번 What is n, Daddy? (1) | 2021.06.04 |
| 백준 6780번 Sumac Sequences (0) | 2021.06.04 |
| 백준 6779번 Who Has Seen The Wind (0) | 2021.06.04 |