POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode【DFS+DP】

Alphacode
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 15489 Accepted: 4649

Description

Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages:
Alice: “Let’s just use a very simple code: We’ll assign ‘A’ the code word 1, ‘B’ will be 2, and so on down to ‘Z’ being assigned 26.”
Bob: "That’s a stupid code, Alice. Suppose I send you the word ‘BEAN’ encoded as 25114. You could decode that in many different ways!”
Alice: "Sure you could, but what words would you get? Other than ‘BEAN’, you’d get ‘BEAAD’, ‘YAAD’, ‘YAN’, ‘YKD’ and ‘BEKD’. I think you would be able to figure out the correct decoding. And why would you send me the word ‘BEAN’ anyway?”
Bob: “OK, maybe that’s a bad example, but I bet you that if you got a string of length 500 there would be tons of different decodings and with that many you would find at least two different ones that would make sense.”
Alice: “How many different decodings?”
Bob: “Jillions!”

For some reason, Alice is still unconvinced by Bob’s argument, so she requires a program that will determine how many decodings there can be for a given string using her code.

Input

Input will consist of multiple input sets. Each set will consist of a single line of digits representing a valid encryption (for example, no line will begin with a 0). There will be no spaces between the digits. An input line of ‘0’ will terminate the input and should not be processed.

Output

For each input set, output the number of possible decodings for the input string. All answers will be within the range of a long variable.

Sample Input

25114
1111111111
3333333333
0

Sample Output

6
89
1

Source

East Central North America 2004

问题链接：POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode
问题简述：（略）
问题分析：简单题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序（记忆化递归）如下：

/* POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode */#include <iostream>
#include <cstdio>
#include <cstring>using namespace std;typedef long long LL;
const int N = 1e5 + 2;
char s[N];
int len;
LL dp[N];LL dfs(int k)
{if (k >= len - 1) return 1;else if (dp[k]) return dp[k];if (s[k + 1]) dp[k] += dfs(k + 1);if (s[k] * 10 + s[k + 1] <= 26 && s[k + 2]) dp[k] += dfs(k + 2);return dp[k];
}int main()
{while (~scanf("%s", s) && strcmp(s, "0") != 0) {len = strlen(s);for (int i = 0; i < len; i++) s[i] -= '0';s[len] = 1;memset(dp, 0, sizeof dp);printf("%lld\n", dfs(0));}return 0;
}

AC的C++语言程序（DP）如下：

/* POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode */#include <iostream>
#include <cstdio>
#include <cstring>using namespace std;typedef long long LL;
const int N = 1e5 + 2;
char s[N];
int len;
LL dp[N];int main()
{while (~scanf("%s", s) && strcmp(s, "0") != 0) {len = strlen(s);for (int i = 0; i < len; i++) s[i] -= '0';s[len] = 1;memset(dp, 0, sizeof dp);dp[len] = 1;for (int i = len - 1; i >= 0; i--)if (s[i]) {dp[i] = dp[i + 1];if (s[i] * 10 + s[i + 1] <= 26)dp[i] += dp[i + 2];}printf("%lld\n", dp[0]);}return 0;
}

POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode【DFS+DP】相关推荐

【数位DP】恨7不成妻
[数位DP]恨7不成妻时间限制: 1 Sec 内存限制: 128 MB 提交: 8 解决: 4 [提交] [状态] [命题人:admin] 题目描述单身! 依然单身! 吉哥依然单身! DS级码 ...
【概率DP】$P2059$ 卡牌游戏
[概率DP]P2059 卡牌游戏链接题目描述 N个人坐成一圈玩游戏.一开始我们把所有玩家按顺时针从1到N编号.首先第一回合是玩家1作为庄家.每个回合庄家都会随机(即按相等的概率)从卡牌堆里选择一张 ...
Bailian4004 数字组合【递归+DP】
4004:数字组合总时间限制: 1000ms 内存限制: 65536kB 描述有n个正整数,找出其中和为t(t也是正整数)的可能的组合方式.如: n=5,5个数分别为1,2,3,4,5,t=5: ...
UVA497 Strategic Defense Initiative【LIS+DP】
"Commander! Commander! Please wake up commander!" "- mmmph. What time is it?" ...
Bailian2755 神奇的口袋【递归+DP】
2755:神奇的口袋总时间限制: 10000ms 内存限制: 65536kB 描述有一个神奇的口袋,总的容积是40,用这个口袋可以变出一些物品,这些物品的总体积必须是40.John现在有n个想要得 ...
20天拿下华为OD笔试之【DFS/BFS】2023Q1A-开心消消乐【闭着眼睛学数理化】全网注释最详细分类最全的华为OD真题题解
[DFS/BFS]2023Q1A-开心消消乐题目描述与示例题目描述给定一个 N 行 M 列的二维矩阵,矩阵中每个位置的数字取值为 0 或 1,矩阵示例如: 1 1 0 0 0 0 0 1 0 0 ...
【限时免费】20天拿下华为OD笔试之【DFS/BFS】2023B-寻找最大价值的矿堆【闭着眼睛学数理化】全网注释最详细分类最全的华为OD真题题解
[DFS/BFS]2023B-寻找最大价值的矿堆题目描述与示例给你一个由 '0'(空地).'1'(银矿).'2'(金矿)组成的的地图,矿堆只能由上下左右相邻的金矿或银矿连接形成.超出地图范围可以认 ...
【动态规划dp】青蛙的烦恼（frog）
青蛙的烦恼(frog) [题目描述] 池塘中有 n 片荷叶恰好围成了一个凸多边形,有一只小青蛙恰好站在 1 号荷叶上,小青蛙想通过最短的路程遍历所有的荷叶(经过一个荷叶一次且仅一次),小青蛙可以从一 ...
【搜索+DP】codevs1066-引水入城
[题目大意] 一个N行M列的矩形,如上图所示,其中每个格子都代表一座城市,每座城市都有一个海拔高度.现在要在某些城市建造水利设施.水利设施有两种,分别为蓄水厂和输水站.蓄水厂的功能是利用水泵将湖泊中 ...

POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode【DFS+DP】

POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode【DFS+DP】相关推荐

最新文章

热门文章