A1116 | [COCI-2007_2008-contest3]#4 OKTALNI
来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
Slavko is learning about different numeral systems. Slavko is not the brightest when it comes to math, so he is starting out converting binary numerals to octal. The algorithm Slavko uses is this:
• Pad the binary numeral with zeros on the left until the number of digits is divisible by three.
• Group adjacent binary digits into groups of 3 digits.
• Replace each group of binary digits with the corresponding octal digit (as in the table on the right).
Write a program that converts a binary numeral to octal so that Slavko can verify his results.
000 0 001 1 010 2 011 3 100 4 101 5 110 6 111 7
• Pad the binary numeral with zeros on the left until the number of digits is divisible by three.
• Group adjacent binary digits into groups of 3 digits.
• Replace each group of binary digits with the corresponding octal digit (as in the table on the right).
Write a program that converts a binary numeral to octal so that Slavko can verify his results.
000 0 001 1 010 2 011 3 100 4 101 5 110 6 111 7
输入格式
The input contains a binary numeral. The number of digits will be less than 100, and the first digit will be
1.
1.
输出格式
Output the number in octal.
输入输出样例
输入 #1
1010
输出 #1
12
输入 #2
11001100
输出 #2
314
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted