Codeforces-Edu6-B. Grandfather Dovlet’s calculator

B. Grandfather Dovlet’s calculator
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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

简单题，根据题意直接做就行；
代码如下：

#include <bits/stdc++.h>using namespace std;int main(){    int sum=0,i,a,b,y,n;    cin>>a>>b;    for(i=a;i<=b;i++)    {        n=i;        while(n)        {        y=n%10;        n=n/10;        switch(y)        {            case 0:sum+=6;break;            case 1:sum+=2;break;            case 2:sum+=5;break;            case 3:sum+=5;break;            case 4:sum+=4;break;            case 5:sum+=5;break;            case 6:sum+=6;break;            case 7:sum+=3;break;            case 8:sum+=7;break;            case 9:sum+=6;break;        }         }    }    cout<<sum;}

仅代表个人观点，不喜勿喷！