Onnenluku

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;

ll pot(ll x){
    return (1ll<<x);
}

ll luck(string s, char a, char b){
    ll r=0;
    if (s.size()>1) r+=pot((int)s.size()-1);
    int h=0;
    for (int i=0;i<(int)s.size();i++){
        h=0;
        if (s[i]>b){
            r+=pot((int)s.size()-i);
        }
        else if(b>s[i]&&s[i]>a){
            r+=pot((int)s.size()-1-i);
        }
        else if (s[i]==b){
            r+=pot((int)s.size()-1-i);
            h=1;
        }
        else if(s[i]==a){
            h=1;
        }
        if (!h) break;
        if (h==1&&i==(int)s.size()-1){
            r++;
        }
    }
    return r;
}

ll luck2(string s, char a){
    ll r=0;
    r+=(ll)s.size()-1;
    for (int i=0;i<(int)s.size();i++){
        if (s[i]<a) return r;
        if (s[i]>a) return r+1;
    }
    return r+1;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string a,b;
    cin>>a>>b;
    ll v=0;
    for (char ac='1';ac<='9';ac++){
        for (char bc=ac+1;bc<='9';bc++){
            v+=luck(b, ac, bc);
            v-=luck(a, ac, bc);
        }
    }

    for (int c='1';c<='9';c++){
        v-=luck2(b, c)*8;
        v+=luck2(a, c)*8;
    }
    map<char, int> lol;
    for (int i=0;i<(int)a.size();i++){
        lol[a[i]]=1;
    }
    if (lol.size()==2){
        v++;
    }
    cout<<v<<endl;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER