QOJ.ac

QOJ

时间限制: 1.0 s 内存限制: 32 MB 总分: 20

#17109. 八进制

统计

Slavko 正在学习不同的数制。Slavko 在数学方面不是很聪明,所以他决定从将二进制数转换为八进制数开始。Slavko 使用的算法如下:

  • 在二进制数的左侧补零,直到其位数能被 3 整除。
  • 将相邻的二进制位每 3 位分为一组。
  • 将每组二进制数替换为对应的八进制数(如下表所示)。
二进制 八进制
000 0
001 1
010 2
011 3
100 4
101 5
110 6
111 7

编写一个程序,将二进制数转换为八进制数,以便 Slavko 能够验证他的结果。

输入格式

输入包含一个二进制数。该数的位数将小于 100,且第一位数字为 1。

输出格式

输出该数的八进制表示。

样例

输入样例 1

1010

输出样例 1

12

输入样例 2

11001100

输出样例 2

314

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.