NB群友

最新推荐文章于 2022-12-07 10:21:21 发布

newhonor

最新推荐文章于 2022-12-07 10:21:21 发布

阅读量102

点赞数

分类专栏： dfs 记忆化搜索

本文链接：https://blog.csdn.net/weixin_39132605/article/details/89339190

版权

dfs 同时被 2 个专栏收录

33 篇文章 0 订阅

订阅专栏

记忆化搜索

6 篇文章 0 订阅

订阅专栏

https://ac.nowcoder.com/acm/contest/625/A

题意：求一个数数z字(不包含0，1)的积在[l,r]的数有多少；

思路：相当于把一个数能分成2-9乘积的种数；dfs记忆化搜索；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e3+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

map<ll,ll>mp;
ll dfs(ll x)
{
    if(mp.count(x)) return mp[x];
    ll sum=0;
    for(int i=2;i<=9;i++)
    {
        if(x>=i) sum+=dfs(x/i)+1;
    }
    mp[x]=sum;
    return sum;
}
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);


    int t;
    sc(t);
    mp[0]=0;
    mp[1]=0;
    while(t--)
    {
        ll l,r;
        sc(l);
        sc(r);
        cout<<MOD(dfs(r)-dfs(l-1))<<endl;

    }
    return 0;
}