A9709 | Digital Counter
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Malek lives in an apartment block with $100$ floors numbered from $0$ to $99$ . The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with $7$ light sticks by turning them on or off. The picture below shows how the elevator shows each digit.
One day when Malek wanted to go from floor $88$ to floor $0$ using the elevator he noticed that the counter shows number $89$ instead of $88$ . Then when the elevator started moving the number on the counter changed to $87$ . After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number $n$ . Malek calls an integer $x$ ( $0<=x<=99$ ) good if it's possible that the digital counter was supposed to show $x$ but because of some(possibly none) broken sticks it's showing $n$ instead. Malek wants to know number of good integers for a specific $n$ . So you must write a program that calculates this number. Please note that the counter always shows two digits.
One day when Malek wanted to go from floor $88$ to floor $0$ using the elevator he noticed that the counter shows number $89$ instead of $88$ . Then when the elevator started moving the number on the counter changed to $87$ . After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.
Suppose the digital counter is showing number $n$ . Malek calls an integer $x$ ( $0<=x<=99$ ) good if it's possible that the digital counter was supposed to show $x$ but because of some(possibly none) broken sticks it's showing $n$ instead. Malek wants to know number of good integers for a specific $n$ . So you must write a program that calculates this number. Please note that the counter always shows two digits.
输入格式
The only line of input contains exactly two digits representing number $n$ ( $0<=n<=99$ ). Note that $n$ may have a leading zero.
输出格式
In the only line of the output print the number of good integers.
输入输出样例
输入 #1
89
输出 #1
2
输入 #2
00
输出 #2
4
输入 #3
73
输出 #3
15
In the first sample the counter may be supposed to show $88$ or $89$ .
In the second sample the good integers are $00$ , $08$ , $80$ and $88$ .
In the third sample the good integers are $03,08,09,33,38,39,73,78,79,83,88,89,93,98,99$ .
In the second sample the good integers are $00$ , $08$ , $80$ and $88$ .
In the third sample the good integers are $03,08,09,33,38,39,73,78,79,83,88,89,93,98,99$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted