Submission

Score: 10

User: ocean

Problemset: Strobogrammatic Numbers

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-12 20:11:06

#include <bits/stdc++.h>
using namespace std;


int main() {
    int n, k;
    cin >> n >> k;
    int  arr[29] ={0,1,69,96,88,101,181,888,1001,1881,6699,8888,9966,10001,18881,88888,100001,188881,6669999,888888,999666,1000001,1888881,8888888,10000001,18888881,66669999,88888888,99996666};
int count=1;
int y=0;
if(n==0&&k==0||n==1&&k==1){
    cout<<1;
    return 0;
}
if(n==0&&k==1){
    cout<<2;
    return 0;
}
   for(int i=0;i<29;i++){
 if(arr[i]>=n){
    y=i;
    break;
 }
   }
   for(int i=0;i<29;i++){
 if(arr[i]>=k){
    count=i;
    break;
 }
   }
   cout<<count-y;

    return 0;
}