#include <cstdio>
long long int memo[50];
long long int f(long long int n)
{
memo[1] = 3;
memo[2] = 8;
for(long long int i = 3; i <= n; ++ i)
{
memo[i] = 2 * memo[i - 1] + 2 ...
阿牛的EOF牛肉串
http://acm.hdu.edu.cn/showproblem.php?pid=2047
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35402 Accepted Submi...
阿牛的EOF牛肉串
http://acm.hdu.edu.cn/showproblem.php?pid=2047
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35402 Accepted Subm...
阿牛的EOF牛肉串
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16106 Accepted Submission(s): 7538
Problem Description
今年的ACM暑期集训...