跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1401. Grandfather Dovlet’s calculator

    ID: 1407 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 1 上传者: 标签>模拟编程与模拟入门难度共享题库Codeforces英文题面题目来源题面语言

Grandfather Dovlet’s calculator

题目描述

B. Grandfather Dovlet’s calculator
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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).

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≤ab≤106) − 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
12
Input
10 15
Output
39

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 904 题。保留原作者与原赛事署名。