#include <iostream>
long long t[1000010];
int n;
int main(){
t[0] = 1; t[1] = 1; t[2] = 2;
std::cin >> n;
for (int i = 3; i <= n; i++) t[i] = ((t[i-1]<<1)%10000+t[i-3])%10000;
std::cout << t[n]%10000;
return 0;
}
【洛谷】P1990 覆盖墙壁
最新推荐文章于 2024-07-22 15:43:53 发布