UVA-580
来源:互联网 发布:java 微信 编辑:程序博客网 时间:2024/06/07 18:46
#include <stdio.h>#include <iostream>#include <string.h>#include <math.h>using namespace std;unsigned long long dp[1000];int main(){ dp[1]=2; dp[2]=4; dp[3]=7; dp[4]=13; for(int i=5;i<100;i++){ dp[i]=dp[i-1]*2-dp[i-4]; // cout<<dp[i]<<endl; } int n; while(~scanf("%d",&n)){ if(n==0)break; unsigned long long t=pow(2,n)-dp[n]; printf("%d\n",t); } return 0;}
0 0
- UVA 580
- uva 580
- UVA 580
- UVA-580
- UVA 580 Critical Mass
- UVa, 580 Critical Mass
- UVA 580Critical Mass
- 【UVA】580-Critical Mass
- UVa 580 - Critical Mass
- UVa 580-Critical Mass
- uva 580 Critical Mass
- UVA 580 Critical Mass
- UVa 580 Critical Mass
- UVa 580 Critical Mass
- 动态规划UVA 580
- Uva 580 排列组合
- uva
- UVA
- 《转》ScrollView中嵌套ListView和Viewpager问题
- [02]使用 JavaScript
- Longest Substring Without Repeating Characters(最长无重复子字符串算法)
- UVA-10128
- UVA-12563
- UVA-580
- 用Apache POI读取Excel并下载
- express 路由
- LeetCode:maximum-depth-of-binary-tree
- 30:Remove Duplicates from Sorted List
- lua + openresty web API 框架
- express.static 作用及用法
- linux下的静态库和动态库
- 树莓派新安装