1910: C-WTF_number
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 50 Solved: 19
[Submit][Status][Web Board]Description
wtf number是一个神奇的数,相邻两个数字之差至少为3的正整数称为wtf number。 cc想知道,
在l和r之间(包括l和r),总共有多少个wtf number?Input
两个整数l r (1 <=l <=r <=INT_MAX)
Output
一个整数
Sample Input
1 10 10 20
Sample Output
9 6
HINT
wtf_number不存在前导0
Source
一直不怎么会搞dp啊
常回来再看看
#include<bits/stdc++.h>
#define ll long long
#define ve vector
#define mp map
#define NO cout<<"NO"<<endl;
#define YES cout<<"YES"<<endl;
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define st string
#define N 10005
using namespace std;
const int maxn=1e6+5;
const ll mod =1e15;
const int dx[]={-1,0,1,0};
const int dy[]={0,1,0,-1};
//set<ll> s;
ve<ll> v;
priority_queue<ll, ve<ll>, greater<ll> >q;
ll f[30][20],bit[60];
ll n;
ll pprint(ll n);
ll dfs(ll pos,ll pre,bool sp)//记录当前, 递归传参上一位,判断特殊条件 (标记)
{
if(pos<=0) return 1;
if(!sp&&f[pos][pre]!=-1) return f[pos][pre];
ll num=sp ? bit[pos]:9;
ll ans=0,pre_l;
for(ll i=0;i<=num;i++){
if(abs(pre-i)>=3){
pre_l=i;
if(pre==-3&&i==0)pre_l=-3;//特殊情况前面全是0,赋值-3,保证后面的数都满足题意
ans+=dfs(pos-1,pre_l,sp&&i==num);
}
}
if(!sp)f[pos][pre]=ans;
return ans;
}
int main()
{
mem(f,-1);
mem(bit,0);
ll l,r;
while(cin>>l>>r){
cout<<pprint(r)-pprint(l-1);}
return 0;
}
ll pprint(ll n)
{
ll len=0;
while(n)
{
bit[++len]=n%10;
n/=10;
}
return dfs(len,-3,1);//前导零特判
}