COCI 2007/2008, Contest #3
Task OKTALNI
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 |
Input
The input contains a binary numeral. The number of digits will be less than 100, and the first digit will be 1.
Output
Output the number in octal.
Examples
Input1010 Output12 |
Input11001100 Output314 |
All Submissions
Best Solutions
Point Value: 3
Time Limit: 1.00s
Memory Limit: 32M
Added: Jul 30, 2013
Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
Comments (Search)
Do some testing of your own. Create some inputs, figure out what the output should be, then run it on your code. You will want to ensure that every possible case is covered.
is there a reason to why this is?