[HDU 3555] Bomb [数位DP]
Source
2010 ACM-ICPC Multi-University Training Contest(12)
http://acm.hdu.edu.cn/showproblem.php?pid=3555
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#define maxn 25
using namespace std;
typedef long long LL;
LL N,n,dp[maxn][3];
//dp[i][j]:i->lenth j->status