ALGORITHM/BAEKJOON [BAEKJON] 1309 동물원 l_j_yeon 2017. 9. 26. 12:49 #define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; int main() { int n; scanf("%d", &n); vector>DP(2, vector(3, 0)); for (int j = 0; j < 3; j++) DP[0][j] = 1; int k = 0; long long answer = 0; for (int j = 0; j < n - 1; j++) { DP[!k][0] = (DP[k][0] + DP[k][1] + DP[k][2]) % 9901; DP[!k][1] = (DP[k][0] + DP[k][2]) % 9901; DP[!k][2] = (DP[k][0] + DP[k][1]) % 9901; k = !k; } k % 2 == 0 ? k = 0 : k = 1; printf("%d\n", (DP[k][0] + DP[k][1] + DP[k][2]) % 9901); return 0; } 저작자표시 비영리 변경금지 (새창열림)