문제 링크입니다: https://www.acmicpc.net/problem/6780
6780번: Sumac Sequences
In a sumac sequence, t1, t2, .., tm, each term is an integer greater than or equal 0. Also, each term, starting with the third, is the difference of the preceding two terms (that is, tn+2 = tn − tn+1 for n ≥ 1). The sequence terminates at tm if tm−1
www.acmicpc.net
간단한 구현 문제였습니다.
개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
| 백준 6975번 Deficient, Perfect, and Abundant (0) | 2021.06.04 |
|---|---|
| 백준 6794번 What is n, Daddy? (1) | 2021.06.04 |
| 백준 6779번 Who Has Seen The Wind (0) | 2021.06.04 |
| 백준 6696번 Too Much Water (0) | 2021.06.03 |
| 백준 6609번 모기곱셈 (0) | 2021.06.03 |