結果

問題 No.1269 I hate Fibonacci Number
コンテスト
ユーザー Chanyuh
提出日時 2020-10-24 00:35:05
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 132 ms / 3,000 ms
コード長 5,392 bytes
コンパイル時間 1,975 ms
コンパイル使用メモリ 141,368 KB
最終ジャッジ日時 2025-01-15 14:46:44
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

template<int mod>
struct ModInt {
    long long x;
    static constexpr int MOD = mod;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    explicit operator int() const {return x;}
 
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
 
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    ModInt operator%(const ModInt &p) const { return ModInt(0); }         
 
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
 
    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt power(long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
            ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }

    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};

using modint = ModInt<mod>;



int n;
ll L,R;
vector<ll> F_={1,1};
vector<string> F={"1"};
vector<string> S={"","0"};
int to[800][10],suf[800][10];
bool ng[800];
modint dp[5010][800];

void solve(){
    cin >> n;
    cin >> L >> R;
    int n_=2;
    while(F_.back()<INF){
        F_.push_back(F_[n_-1]+F_[n_-2]);
        F.push_back(to_string(F_.back()));
        n_++;
    }
    //cout << n << endl;
    // rep(i,n){
    //     cout << F[i] << ",";
    // }
    int m=F.size();
    rep(i,m){
        rep(j,F[i].size()){
            S.push_back(F[i].substr(0,j+1));
        }
    }
    sort(S.begin(),S.end());
    S.erase(unique(S.begin(),S.end()),S.end());
    int z=S.size();
    // cout << S.size() << endl;
    // for(string s:S){
    //     cout << s << endl;
    // }
    rep(i,z){
        rep(k,10){
            string s_=S[i]+to_string(k);
            int l=s_.length();
            rep(j,z){
                int d=S[j].length();
                if(d>l) continue;
                if(s_.substr(l-d,l)==S[j]) if(chmax(suf[i][k],d)) to[i][k]=j;
            }
            if(to[i][k]==0) cout << s_ << " " << S[to[i][k]] << endl;
        }
    }
    rep(i,z){
        rep(j,n_){
            //cout << i << S[i].length() << " " << j << endl;
            if(F_[j]>=L && F_[j]<=R){
                string t=to_string(F_[j]);int d=t.length();
                //cout << t << endl;
                if(S[i].length()<d) continue;
                rep(k,S[i].length()-d+1){
                    //cout << S[i].substr(k,k+d) << " " << t << endl;
                    if(S[i].substr(k,k+d)==t){
                        ng[i]=true;
                        break;
                    }
                }
            }
        }
    }
    dp[0][0]=1;
    rep(i,n){
        rep(j,z){
            rep(k,10){
                dp[i+1][to[j][k]]+=dp[i][j];
            }
        }
        rep(j,z){
            if(ng[j])dp[i+1][j]=0;
        }
    }
    modint ans=0;
    rep(j,z){
        //cout << S[j] << " " << dp[n][j] << endl;
        ans+=dp[n][j];
    }
    cout << ans-1 << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}
0