URAL1009 K-based Numbers,简单DP
2011-11-22 21:01
323 查看
很简单的DP题,对于K进制,如果运算到第i位,则第i位只有k-1可以选择,然后分i-1位是0还是非零讨论。
/******************************************************************************* # Author : Neo Fung # Email : neosfung@gmail.com # Last modified: 2011-11-22 21:02 # Filename: URAL1009 K-based Numbers.cpp # Description : ******************************************************************************/ // #include "stdafx.h" // #define DEBUG #include <fstream> #include <stdio.h> #include <iostream> #include <string.h> #include <string> #include <memory.h> #include <limits.h> #include <algorithm> #include <math.h> using namespace std; int main(void) { #ifdef DEBUG freopen("C:/Users/neo/Desktop/stdin.txt","r",stdin); freopen("C:/Users/neo/Desktop/stdout.txt","w",stdout); #endif __int64 dp[100]; int n,k; while(~scanf("%d%d",&n,&k)) { dp[0]=k-1; dp[1]=(k-1)*k; for(int i=2;i<n;++i) dp[i]=(k-1)*(dp[i-1]+dp[i-2]); printf("%I64d\n",dp[n-1]); } return 0; }
相关文章推荐
- URAL - 1009 - K-based Numbers (简单DP)
- Ural 1009 K-based Numbers(DP)
- URAL1009 - K-based Numbers - 数位dp
- URAL1009——DP——K-based Numbers
- URAL - 1009 简单DP..新的开始...
- 递推DP URAL 1009 K-based Numbers
- URAL 1009 K-based Numbers (DP动态规划)
- URAL 1009 K-based numbers(DP递推)
- ural 1009. K-based Numbers(简单dp)
- URAL 1018 二叉苹果树(简单树形dp)
- Timus 1009 K-based Numbers (DP)
- URAL 1081. Binary Lexicographic Sequence(简单dp)
- URAL1009 K-based Numbers
- Ural - Timus - 1009 K-based Numbers 题解
- URAL 1119. Metro(简单dp)
- URAL 1635. Mnemonics and Palindromes(简单区间dp)
- URAL 1152 False Mirrors(简单的状态压缩dp)
- URAL 1114 Boxes(简单dp)
- ural1009 第一个动态规划(dp)题目 。。。似乎也可以用dfs+记忆化收索 解。。。
- ural 1009 K-based Numbers