1. 神奇的青蛙 #include <iostream> #include <vector> using namespace std; long solve(long n) { vector<long> dp(n + 1, 0); dp[0] = 1; dp[1] = 1; for(long i = 2; i < n + 1; ++i) { for(long j = 1; j <= i; j <<= 1) { dp[i] += dp[i-j]; ...