Educational Codeforces Round 6 B. Grandfather Dovlet’s calculator(模拟)

Educational Codeforces Round 6B：http://codeforces.com/contest/620/problem/B

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 ≤ a ≤ b ≤ 106) — the first and the last number typed by Max.

Output

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

Sample test(s)

input

1 3

output

12

input

10 15

output

39

题目大意：计算器每一个数字有num[i]个指示器亮，计算a~b中出现数字的指示器之和

数据范围很小，直接计算即可，还浪费20min写了个错误的算法，什么时候才能改不看数据的习惯

直接从a开始计算每一位的数字，直到计算至b

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main() {
    int a,b,num[10]={6,2,5,5,4,5,6,3,7,6},t;
    long long ans=0;
    scanf("%d%d",&a,&b);
    for(;a<=b;++a) {
        t=a;
        while(t) {
            ans+=num[t%10];
            t/=10;
        }
    }
    printf("%I64d\n",ans);
    return 0;
}