A10238 | Grandfather Dovlet’s calculator
时间限制1s
内存限制256MB
通过 / 提交0/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](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$ .
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$ .
输入格式
The only line contains two integers $a,b$ ( $1<=a<=b<=10^{6}$ ) — the first and the last number typed by Max.
输出格式
Print the only integer $a$ — the total number of printed segments.
输入输出样例
输入 #1
1 3
输出 #1
12
输入 #2
10 15
输出 #2
39
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted