chaesoo
so0ob
chaesoo
전체 방문자
오늘
어제
  • 분류 전체보기 (169)
    • 알고리즘 (157)
      • 백준 다시풀기 (8)
      • solved.ac (137)
      • 백준 알고리즘 공부 (12)
    • 활동일지 (5)
    • 개발 (5)
      • Unity (4)
    • 책 공부 (2)
      • clean code (2)

블로그 메뉴

  • 홈
  • 태그
  • 방명록

공지사항

인기 글

태그

  • 구현
  • SW마에스트로 13기
  • dfs
  • 백준2448
  • 다익스트라
  • 클린코드
  • 알고리즘
  • 게임개발
  • 클린코드2장
  • DP
  • solved.ac
  • 백준
  • 자료구조
  • 최단거리알고리즘
  • 유니티
  • 소마13기
  • C++
  • 분할정복
  • 정보처리기사 2021 합격률
  • 디코봇 파이썬
  • 로아 디코봇
  • 백준미세먼지안녕!
  • 로스트아크 디코 봇
  • 디스코드 봇 파이썬
  • 문자열
  • 분할정복거듭제곱
  • 다시풀기
  • 디코 봇
  • 플로이드-와샬
  • BFS

최근 댓글

최근 글

티스토리

hELLO · Designed By 정상우.
chaesoo

so0ob

알고리즘/solved.ac

[class3] (백준 9461) 파도반 수열

2021. 11. 7. 16:06

문제

오른쪽 그림과 같이 삼각형이 나선 모양으로 놓여져 있다. 첫 삼각형은 정삼각형으로 변의 길이는 1이다. 그 다음에는 다음과 같은 과정으로 정삼각형을 계속 추가한다. 나선에서 가장 긴 변의 길이를 k라 했을 때, 그 변에 길이가 k인 정삼각형을 추가한다.

파도반 수열 P(N)은 나선에 있는 정삼각형의 변의 길이이다. P(1)부터 P(10)까지 첫 10개 숫자는 1, 1, 1, 2, 2, 3, 4, 5, 7, 9이다.

N이 주어졌을 때, P(N)을 구하는 프로그램을 작성하시오.

입력

첫째 줄에 테스트 케이스의 개수 T가 주어진다. 각 테스트 케이스는 한 줄로 이루어져 있고, N이 주어진다. (1 ≤ N ≤ 100)

출력

각 테스트 케이스마다 P(N)을 출력한다.

제한

 

예제 입력 1

2
6
12

예제 출력 1

3
16

힌트

 
W3sicHJvYmxlbV9pZCI6Ijk0NjEiLCJwcm9ibGVtX2xhbmciOiIwIiwidGl0bGUiOiJcdWQzMGNcdWIzYzRcdWJjMTggXHVjMjE4XHVjNWY0IiwiZGVzY3JpcHRpb24iOiI8cD48aW1nIGFsdD1cIlwiIHNyYz1cIlwvdXBsb2FkXC9pbWFnZXNcL3BhbmRvdmFuLnBuZ1wiIHN0eWxlPVwiZmxvYXQ6cmlnaHQ7IGhlaWdodDoxODJweDsgd2lkdGg6Mjg5cHhcIiBcLz5cdWM2MjRcdWI5NzhcdWNhYmQgXHVhZGY4XHViOWJjXHVhY2ZjIFx1YWMxOVx1Yzc3NCBcdWMwYmNcdWFjMDFcdWQ2MTVcdWM3NzQgXHViMDk4XHVjMTIwIFx1YmFhOFx1YzU5MVx1YzczY1x1Yjg1YyBcdWIxOTNcdWM1ZWNcdWM4MzggXHVjNzg4XHViMmU0LiBcdWNjYWIgXHVjMGJjXHVhYzAxXHVkNjE1XHVjNzQwIFx1YzgxNVx1YzBiY1x1YWMwMVx1ZDYxNVx1YzczY1x1Yjg1YyBcdWJjYzBcdWM3NTggXHVhZTM4XHVjNzc0XHViMjk0IDFcdWM3NzRcdWIyZTQuIFx1YWRmOCBcdWIyZTRcdWM3NGNcdWM1ZDBcdWIyOTQgXHViMmU0XHVjNzRjXHVhY2ZjIFx1YWMxOVx1Yzc0MCBcdWFjZmNcdWM4MTVcdWM3M2NcdWI4NWMgXHVjODE1XHVjMGJjXHVhYzAxXHVkNjE1XHVjNzQ0IFx1YWNjNFx1YzE4ZCBcdWNkOTRcdWFjMDBcdWQ1NWNcdWIyZTQuIFx1YjA5OFx1YzEyMFx1YzVkMFx1YzExYyBcdWFjMDBcdWM3YTUgXHVhZTM0IFx1YmNjMFx1Yzc1OCBcdWFlMzhcdWM3NzRcdWI5N2Mga1x1Yjc3YyBcdWQ1ODhcdWM3NDQgXHViNTRjLCBcdWFkZjggXHViY2MwXHVjNWQwIFx1YWUzOFx1Yzc3NFx1YWMwMCBrXHVjNzc4IFx1YzgxNVx1YzBiY1x1YWMwMVx1ZDYxNVx1Yzc0NCBcdWNkOTRcdWFjMDBcdWQ1NWNcdWIyZTQuPFwvcD5cclxuXHJcbjxwPlx1ZDMwY1x1YjNjNFx1YmMxOCBcdWMyMThcdWM1ZjQgUChOKVx1Yzc0MCBcdWIwOThcdWMxMjBcdWM1ZDAgXHVjNzg4XHViMjk0IFx1YzgxNVx1YzBiY1x1YWMwMVx1ZDYxNVx1Yzc1OCBcdWJjYzBcdWM3NTggXHVhZTM4XHVjNzc0XHVjNzc0XHViMmU0LiBQKDEpXHViZDgwXHVkMTMwIFAoMTApXHVhZTRjXHVjOWMwIFx1Y2NhYiAxMFx1YWMxYyBcdWMyMmJcdWM3OTBcdWIyOTQgMSwgMSwgMSwgMiwgMiwgMywgNCwgNSwgNywgOVx1Yzc3NFx1YjJlNC48XC9wPlxyXG5cclxuPHA+Tlx1Yzc3NCBcdWM4ZmNcdWM1YjRcdWM4NGNcdWM3NDQgXHViNTRjLCBQKE4pXHVjNzQ0IFx1YWQ2Y1x1ZDU1OFx1YjI5NCBcdWQ1MDRcdWI4NWNcdWFkZjhcdWI3YThcdWM3NDQgXHVjNzkxXHVjMTMxXHVkNTU4XHVjMmRjXHVjNjI0LjxcL3A+XHJcbiIsImlucHV0IjoiPHA+XHVjY2FiXHVjOWY4IFx1YzkwNFx1YzVkMCBcdWQxNGNcdWMyYTRcdWQyYjggXHVjZjAwXHVjNzc0XHVjMmE0XHVjNzU4IFx1YWMxY1x1YzIxOCBUXHVhYzAwIFx1YzhmY1x1YzViNFx1YzljNFx1YjJlNC4gXHVhYzAxIFx1ZDE0Y1x1YzJhNFx1ZDJiOCBcdWNmMDBcdWM3NzRcdWMyYTRcdWIyOTQgXHVkNTVjIFx1YzkwNFx1Yjg1YyBcdWM3NzRcdWI4ZThcdWM1YjRcdWM4MzggXHVjNzg4XHVhY2UwLCBOXHVjNzc0IFx1YzhmY1x1YzViNFx1YzljNFx1YjJlNC4gKDEgJmxlOyBOICZsZTsgMTAwKTxcL3A+XHJcbiIsIm91dHB1dCI6IjxwPlx1YWMwMSBcdWQxNGNcdWMyYTRcdWQyYjggXHVjZjAwXHVjNzc0XHVjMmE0XHViOWM4XHViMmU0IFAoTilcdWM3NDQgXHVjZDljXHViODI1XHVkNTVjXHViMmU0LjxcL3A+XHJcbiIsImhpbnQiOiIiLCJvcmlnaW5hbCI6IjAiLCJodG1sX3RpdGxlIjoiMCIsInByb2JsZW1fbGFuZ190Y29kZSI6IktvcmVhbiJ9LHsicHJvYmxlbV9pZCI6Ijk0NjEiLCJwcm9ibGVtX2xhbmciOiIxIiwidGl0bGUiOiJQYWRvdmFuIFNlcXVlbmNlIiwiZGVzY3JpcHRpb24iOiI8cD48aW1nIGFsdD1cIlwiIHNyYz1cIlwvdXBsb2FkXC9pbWFnZXNcL3BhbmRvdmFuLnBuZ1wiIHN0eWxlPVwiZmxvYXQ6cmlnaHQ7IGhlaWdodDoxODJweDsgd2lkdGg6Mjg5cHhcIiBcLz5Db25zaWRlciB0aGUgc3BpcmFsIG9mIHRyaWFuZ2xlcyBzaG93biBpbiBGaWd1cmUgMS4gSXQgc3RhcnRzIHdpdGggYW4gZXF1aWxhdGVyYWwgdHJpYW5nbGUsIHRoYXQgaXMsIGEgdHJpYW5nbGUgd2hvc2Ugc2lkZSBsZW5ndGhzIGFyZSB0aGUgc2FtZSwgb2Ygc2lkZSBsZW5ndGggMSBhbmQgaXQgaXMgZXh0ZW5kZWQgYnkgYWRkaW5nIGVxdWlsYXRlcmFsIHRyaWFuZ2xlcyByZXBlYXRlZGx5IGFzIGZvbGxvd3M6IEFuIGVxdWlsYXRlcmFsIHRyaWFuZ2xlIG9mIHNpZGUgbGVuZ3RoIGsgaXMgYWRkZWQgdG8gdGhlIGxvbmdlc3Qgc2lkZSBvZiBhIHNwaXJhbCwgd2hlcmUgayBpcyB0aGUgbGVuZ3RoIG9mIHRoZSBsb25nZXN0IHNpZGUgb2YgdGhlIHNwaXJhbC4mbmJzcDs8XC9wPlxyXG5cclxuPHA+VGhlbiwgdGhlIFBhZG92YW4gc2VxdWVuY2UgUChOKSBpcyB0aGUgc2VxdWVuY2Ugb2Ygc2lkZSBsZW5ndGhzIG9mIHRoZSBlcXVpbGF0ZXJhbCB0cmlhbmdsZXMgaW4gdGhlIHNwaXJhbC4gVGhlIGZpcnN0IDEwIHZhbHVlcyBQKDEpIHRocm91Z2ggUCgxMCkgYXJlIDEsIDEsIDEsIDIsIDIsIDMsIDQsIDUsIDcsIDkuJm5ic3A7PGJyIFwvPlxyXG4mbmJzcDs8YnIgXC8+XHJcbkdpdmVuIGEgcG9zaXRpdmUgaW50ZWdlciBOLCB3cml0ZSBhIHByb2dyYW0gdG8gY29tcHV0ZSBQKE4pLjxcL3A+XHJcbiIsImlucHV0IjoiPHA+WW91ciBwcm9ncmFtIGlzIHRvIHJlYWQgZnJvbSBzdGFuZGFyZCBpbnB1dC4gVGhlIGlucHV0IGNvbnNpc3RzIG9mIFQgdGVzdCBjYXNlcy4gVGhlIG51bWJlciBvZiB0ZXN0IGNhc2VzIFQgaXMgZ2l2ZW4gaW4gdGhlIGZpcnN0IGxpbmUgb2YgdGhlIGlucHV0LiBFYWNoIHRlc3QgY2FzZSBjb25zaXN0cyBvZiBvbmUgbGluZSBjb250YWluaW5nIGFuIGludGVnZXIgTiAoMSAmbGU7IE4gJmxlOyAxMDApLjxcL3A+XHJcbiIsIm91dHB1dCI6IjxwPllvdXIgcHJvZ3JhbSBpcyB0byB3cml0ZSB0byBzdGFuZGFyZCBvdXRwdXQuIFByaW50IGV4YWN0bHkgb25lIGxpbmUgZm9yIGVhY2ggdGVzdCBjYXNlLiBUaGUgbGluZSBzaG91bGQgY29udGFpbiBQKE4pLjxcL3A+XHJcbiIsImhpbnQiOiIiLCJvcmlnaW5hbCI6IjEiLCJodG1sX3RpdGxlIjoiMCIsInByb2JsZW1fbGFuZ190Y29kZSI6IkVuZ2xpc2gifV0=

출처

ICPC > Regionals > Asia Pacific > Korea > Asia Regional - Daejeon 2013 G번

  • 문제를 번역한 사람: baekjoon
  • 문제의 오타를 찾은 사람: eric00513
#include <iostream>
using namespace std;
long long arr[101];
long long GetNumber(int N)
{
    if (N <= 3)
        return 1;
    if (arr[N] == 0)
    {
        arr[N] = GetNumber(N - 2) + GetNumber(N - 3);
    }
    return arr[N];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int testCase, temp;
    cin >> testCase;
    while (testCase-- > 0)
    {
        cin >> temp;
        cout << GetNumber(temp) << '\n';
    }
    return 0;
}
728x90
반응형

'알고리즘 > solved.ac' 카테고리의 다른 글

[class3] (백준 11659) 구간 합 구하기 4  (0) 2021.11.09
[class3] (백준 11399) ATM  (0) 2021.11.08
[class3] (백준 9375) 패션왕 신해빈  (0) 2021.11.06
[class3] (백준 9095) 1, 2, 3 더하기  (0) 2021.11.05
[class3] (백준 2630) 색종이 만들기  (0) 2021.11.04
    '알고리즘/solved.ac' 카테고리의 다른 글
    • [class3] (백준 11659) 구간 합 구하기 4
    • [class3] (백준 11399) ATM
    • [class3] (백준 9375) 패션왕 신해빈
    • [class3] (백준 9095) 1, 2, 3 더하기
    chaesoo
    chaesoo

    티스토리툴바