hdu3555——Bomb
2017-04-16 21:57
197 查看
题意:给定一个数n,求0-n内包含“49”数的个数
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <stack>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 100000007
const int M=1005;
int n,m;
int cnt;
int sx,sy,sz;
int mp[1000][1000];
int pa[M*10],rankk[M];
int head[M*6],vis[M*100];
int dis[M*100];
ll prime[M*1000];
bool isprime[M*1000];
int lowcost[M],closet[M];
char st1[5050],st2[5050];
int len[M*6];
typedef pair<int ,int> ac;
//vector<int> g[M*10];
ll dp[50][20][2];
int has[10500];
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
int dir[8][2]= {{0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
void getpri()
{
ll i;
int j;
cnt=0;
memset(isprime,false,sizeof(isprime));
for(i=2; i<1000000LL; i++)
{
if(!isprime[i])prime[cnt++]=i;
for(j=0; j<cnt&&prime[j]*i<1000000LL; j++)
{
isprime[i*prime[j]]=1;
if(i%prime[j]==0)break;
}
}
}
struct node
{
int v,w;
node(int vv,int ww)
{
v=vv;
w=ww;
}
};
vector<int> g[M*100];
string str[1000];
int bit[15];
ll dfs(int cur,int s,int h49,int e,int z){
if(cur<0) return h49;//return check(s);
if(!e&&!z&&dp[cur][s][h49]!=-1) return dp[cur][s][h49];
int endx=e?bit[cur]:9;
ll ans=0;
for(int i=0;i<=endx;i++){
//if(i==4||s&&i==2)continue;
if(z&&!i) ans+=dfs(cur-1,0,0,e&&i==endx,1);
else ans+=dfs(cur-1,i,h49||(s==4&&i==9),e&&i==endx,0);
//ans+=dfs(cur-1,get_news(s,i),e&&i==endx,0);
}
if(!e&&!z) dp[cur][s][h49]=ans;
return ans;
}
ll solve(ll n){
int len=0;
while(n){
bit[len++]=n%10;
n/=10;
}
return dfs(len-1,0,0,1,1);
}
int main()
{
int i,j,k,t;
ll l,r;
memset(dp,-1,sizeof(dp));
scanf("%d",&t);
while(t--)
{
scanf("%I64d",&r);
printf("%I64d\n",solve(r));
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <stack>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 100000007
const int M=1005;
int n,m;
int cnt;
int sx,sy,sz;
int mp[1000][1000];
int pa[M*10],rankk[M];
int head[M*6],vis[M*100];
int dis[M*100];
ll prime[M*1000];
bool isprime[M*1000];
int lowcost[M],closet[M];
char st1[5050],st2[5050];
int len[M*6];
typedef pair<int ,int> ac;
//vector<int> g[M*10];
ll dp[50][20][2];
int has[10500];
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
int dir[8][2]= {{0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
void getpri()
{
ll i;
int j;
cnt=0;
memset(isprime,false,sizeof(isprime));
for(i=2; i<1000000LL; i++)
{
if(!isprime[i])prime[cnt++]=i;
for(j=0; j<cnt&&prime[j]*i<1000000LL; j++)
{
isprime[i*prime[j]]=1;
if(i%prime[j]==0)break;
}
}
}
struct node
{
int v,w;
node(int vv,int ww)
{
v=vv;
w=ww;
}
};
vector<int> g[M*100];
string str[1000];
int bit[15];
ll dfs(int cur,int s,int h49,int e,int z){
if(cur<0) return h49;//return check(s);
if(!e&&!z&&dp[cur][s][h49]!=-1) return dp[cur][s][h49];
int endx=e?bit[cur]:9;
ll ans=0;
for(int i=0;i<=endx;i++){
//if(i==4||s&&i==2)continue;
if(z&&!i) ans+=dfs(cur-1,0,0,e&&i==endx,1);
else ans+=dfs(cur-1,i,h49||(s==4&&i==9),e&&i==endx,0);
//ans+=dfs(cur-1,get_news(s,i),e&&i==endx,0);
}
if(!e&&!z) dp[cur][s][h49]=ans;
return ans;
}
ll solve(ll n){
int len=0;
while(n){
bit[len++]=n%10;
n/=10;
}
return dfs(len-1,0,0,1,1);
}
int main()
{
int i,j,k,t;
ll l,r;
memset(dp,-1,sizeof(dp));
scanf("%d",&t);
while(t--)
{
scanf("%I64d",&r);
printf("%I64d\n",solve(r));
}
return 0;
}
相关文章推荐
- [数位DP] HDU 3555 Bomb
- [数位dp] hdu 3555 Bomb
- HDU 3555 Bomb
- HDU 3555 Bomb
- 动态规划晋级——HDU 3555 Bomb【数位DP详解】
- HDU 3555 Bomb(数位DP)
- HDU - 3555 Bomb 数位DP
- HDU 3555 Bomb
- HDU 3555 Bomb(数位DP)
- 【数位DP】【HDU 3555】Bomb
- HDU 3555 Bomb ,HDU 2089 深刻学习数位dp (各种方法乱用)
- hdu 3555 Bomb【数位dp~吖!!!!!】
- hdu_3555_Bomb(数位DP)
- 动态规划晋级——HDU 3555 Bomb【数位DP详解】
- hdu 3555 Bomb ( 数位DP)
- hdu 3555 Bomb
- HDU 3555 Bomb(数位DP)
- HDU-3555 Bomb (数位DP)
- hdu 3555 Bomb 数位dp
- [HDU 3555] Bomb