HEPNUM - Heptadecimal Numbers
The Factory of Computer Enhaced Numbers (FCEN) has asked its Development Comitee (DC)
to come up with a way to handle numbers written in base 17.
As everybody knows, base 17 is very important for many scientific applications, as well as for
engineering and other practical uses. Numbers in base 17 can be tough, but are kind and soft
if treated appropiately.
Numbers in base 17 are written by using a set of 17 characters: digits 0 to 9 with their usual
values, and uppercase letters A to G that have values from 10 to 16, respectively.
Base 17, probably because its basement on a prime number, does not require numbers to start
with a non-zero digit, so each number has many representations. For instance, the decimal
number 117 can be written as 6F , but also as 06F or even 00000006F .
Because of this leading-zeroes thing, heptadecimal numbers are hard to compare. As a member
of the FCEN-DC, you were asked to write a program that helps in this difficult and challenging
The input contains several test cases. Each test case is described in a single line that contains
two non-empty strings of at most 105 heptadecimal digits, separated by a single space. The last
line of the input contains two asterisks separated by a single space and should not be processed
as a test case.
For each test case output a single line with the sign “<” if the first heptadecimal number is
smaller than the second one, the sign “>” if the first heptadecimal number is greater than the
second one, or the sign “=” if both heptadecimal numbers are equal.
use mind 2 line of code
Learnt something useful...Nice problem
People who are talking about python being too slow for this, its not python, its your naive approach. I got an AC using python in this question.
use 10^5 + n array enough
silly mistakes coast me some wa but finally AC:)...nice question...
This question has some problem with its input. When i used an array of size 10^5,it showed me segmentation error but changing the size to 10^6 gave me correct answer.
@Pablo Ariel Heiber,
ohh..!! finally AC :)
python gives TLE and the same logic in c++ gives 0.04s AC... is python that slow. Got 2 SIGSEGV just for array size 10^5 instead of 10^5+1..
test cases that may help