The mook jong-dp

来源:互联网 发布:python的idey 编辑:程序博客网 时间:2024/04/30 03:11

http://acm.hdu.edu.cn/showproblem.php?pid=5366


dp

#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>#define inf 1099511627776using namespace std;  int main(){__int64 i;__int64 a[65]={0,1,2,3,5};for (i=5;i<=60;i++)a[i]=a[i-1]+a[i-3]+1;__int64 n;while(scanf("%I64d",&n)!=EOF){printf("%I64d\n",a[n]);}  return 0;}


0 0
原创粉丝点击