【Educational Codeforces Round 6B】【暴力】Grandfather Dovlet’s calculator 区间所有数的火柴总成本

最新推荐文章于 2020-12-02 22:33:52 发布

snowy_smile

最新推荐文章于 2020-12-02 22:33:52 发布

阅读量647

点赞数

分类专栏：题库-CF CodeForces 暴力水题文章标签：题库-CF CodeForces 暴力水题

本文链接：https://blog.csdn.net/snowy_smile/article/details/50774640

版权

题库-CF CodeForces 同时被 3 个专栏收录

280 篇文章 2 订阅

订阅专栏

水题

99 篇文章 0 订阅

订阅专栏

暴力

55 篇文章 0 订阅

订阅专栏

Once Max found an electronic calculator from his grandfather Dovlet's chest. He noticed that the numbers were written with seven-segment indicators (https://en.wikipedia.org/wiki/Seven-segment_display).

$\text{[math]}$

Max starts to type all the values from a to b. After typing each number Max resets the calculator. Find the total number of segments printed on the calculator.

For example if a = 1 and b = 3 then at first the calculator will print 2 segments, then — 5 segments and at last it will print 5 segments. So the total number of printed segments is 12.

Input

The only line contains two integers a, b (1 ≤ a ≤ b ≤ 10⁶) — the first and the last number typed by Max.

Output

Print the only integer a — the total number of printed segments.

Examples

input

1 3

output

input

10 15

output

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1,class T2>inline void gmax(T1 &a,T2 b){if(b>a)a=b;}
template <class T1,class T2>inline void gmin(T1 &a,T2 b){if(b<a)a=b;}
const int N=0,M=0,Z=1e9+7,ms63=0x3f3f3f3f;
int v[10]={6,2,5,5,4,5,6,3,7,6};
int a,b;
int main()
{
	while(~scanf("%d%d",&a,&b))
	{
		int ans=0;
		for(int i=a;i<=b;++i)
		{
			int x=i;
			while(x)
			{
				ans+=v[x%10];
				x/=10;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}