【HDOJ】1508 Alphacode

简单DP。考虑10、20(出现0只能唯一组合)。01(不成立)。

 1 /* 1508 */
 2 #include <iostream>
 3 #include <string>
 4 #include <map>
 5 #include <queue>
 6 #include <set>
 7 #include <stack>
 8 #include <vector>
 9 #include <deque>
10 #include <algorithm>
11 #include <cstdio>
12 #include <cmath>
13 #include <ctime>
14 #include <cstring>
15 #include <climits>
16 #include <cctype>
17 #include <cassert>
18 #include <functional>
19 #include <iterator>
20 #include <iomanip>
21 using namespace std;
22 //#pragma comment(linker,"/STACK:102400000,1024000")
23
24 #define sti                set<int>
25 #define stpii            set<pair<int, int> >
26 #define mpii            map<int,int>
27 #define vi                vector<int>
28 #define pii                pair<int,int>
29 #define vpii            vector<pair<int,int> >
30 #define rep(i, a, n)     for (int i=a;i<n;++i)
31 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
32 #define clr                clear
33 #define pb                 push_back
34 #define mp                 make_pair
35 #define fir                first
36 #define sec                second
37 #define all(x)             (x).begin(),(x).end()
38 #define SZ(x)             ((int)(x).size())
39 #define lson            l, mid, rt<<1
40 #define rson            mid+1, r, rt<<1|1
41
42 const int maxn = 1e5+5;
43 char s[maxn];
44 __int64 dp[maxn];
45
46 int main() {
47     ios::sync_with_stdio(false);
48     #ifndef ONLINE_JUDGE
49         freopen("data.in", "r", stdin);
50         freopen("data.out", "w", stdout);
51     #endif
52
53     int len;
54     __int64 ans;
55
56     while (scanf("%s", s+1)!=EOF && s[1]!=‘0‘) {
57         len = strlen(s+1);
58         rep(i, 1, len+1)    s[i] -= ‘0‘;
59
60         dp[0] = 1;
61         rep(i, 1, len+1) {
62             if (s[i] == 0) {
63                 dp[i] = dp[i-2];
64             } else if (i>1 && s[i-1]>0 && 10*s[i-1]+s[i]<=26) {
65                 dp[i] = dp[i-1] + dp[i-2];
66             } else {
67                 dp[i] = dp[i-1];
68             }
69         }
70
71         ans = dp[len];
72         printf("%I64d\n", ans);
73     }
74
75     #ifndef ONLINE_JUDGE
76         printf("time = %d.\n", (int)clock());
77     #endif
78
79     return 0;
80 }
时间: 2024-08-08 09:53:35

【HDOJ】1508 Alphacode的相关文章

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]

【HDOJ】3509 Buge&#39;s Fibonacci Number Problem

快速矩阵幂,系数矩阵由多个二项分布组成.第1列是(0,(a+b)^k)第2列是(0,(a+b)^(k-1),0)第3列是(0,(a+b)^(k-2),0,0)以此类推. 1 /* 3509 */ 2 #include <iostream> 3 #include <string> 4 #include <map> 5 #include <queue> 6 #include <set> 7 #include <stack> 8 #incl

【HDOJ】1818 It&#39;s not a Bug, It&#39;s a Feature!

状态压缩+优先级bfs. 1 /* 1818 */ 2 #include <iostream> 3 #include <queue> 4 #include <cstdio> 5 #include <cstring> 6 #include <cstdlib> 7 #include <algorithm> 8 using namespace std; 9 10 #define MAXM 105 11 12 typedef struct {

【HDOJ】2424 Gary&#39;s Calculator

大数乘法加法,直接java A了. 1 import java.util.Scanner; 2 import java.math.BigInteger; 3 4 public class Main { 5 public static void main(String[] args) { 6 Scanner cin = new Scanner(System.in); 7 int n; 8 int i, j, k, tmp; 9 int top; 10 boolean flag; 11 int t

【HDOJ】2425 Hiking Trip

优先级队列+BFS. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <queue> 5 using namespace std; 6 7 #define MAXN 25 8 9 typedef struct node_st { 10 int x, y, t; 11 node_st() {} 12 node_st(int xx, int yy, int tt)

【HDOJ】1686 Oulipo

kmp算法. 1 #include <cstdio> 2 #include <cstring> 3 4 char src[10005], des[1000005]; 5 int next[10005], total; 6 7 void kmp(char des[], char src[]){ 8 int ld = strlen(des); 9 int ls = strlen(src); 10 int i, j; 11 12 total = i = j = 0; 13 while (

【HDOJ】2795 Billboard

线段树.注意h范围(小于等于n). 1 #include <stdio.h> 2 #include <string.h> 3 4 #define MAXN 200005 5 #define lson l, mid, rt<<1 6 #define rson mid+1, r, rt<<1|1 7 #define mymax(x, y) (x>y) ? x:y 8 9 int nums[MAXN<<2]; 10 int h, w; 11 12