CodeForces 620B Grandfather Dovlet’s calculator

最新推荐文章于 2019-04-03 01:07:29 发布

颜洛滨

最新推荐文章于 2019-04-03 01:07:29 发布

阅读量697

点赞数

分类专栏： ACM 文章标签： Grandfather Dovlets ACM CodeForces 620B

本文链接：https://blog.csdn.net/xuhuanfeng232/article/details/50589163

版权

ACM 专栏收录该内容

78 篇文章 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 ≤ 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

          思路：简单题目，从a到b依次相加对应的数字的位数对应的数值 
        
          AC代码如下： 
        
         #include <iostream>
using namespace std;

int main(){

    int x[]={6,2,5,5,4,5,6,3,7,6};
    int a,b;
    while(cin>>a>>b){
        long long ans=0;
        for(int i=a;i<=b;i++){
            int tmp=i;
            while(tmp){
                int ttmp=tmp%10;
                ans+=x[ttmp];
                tmp/=10;
            }
        }
        cout<<ans<<endl;
    }

}