TLE#16

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[10]={6,2,5,5,4,5,6,3,7,6};
int cheak(ll num){
    int sum=0;
    while(num>0)
	{
        sum+=a[num%10];
        num/=10;
    }
    return sum;
}
int main()
{
    ll l,r;
    cin>>l>>r;
    int sum=1;
    int ck=cheak(l);
    for(ll i=l+1;i<=r;i++)
	{
        int count=cheak(i);
        if(count==ck)
		{
            sum=max(sum,int(i-l+1));
        }
		else
		{
            l=i;
            ck=count;
        }
    }
    cout<<sum<<endl;
    return 0;
}