The roman hackerus

Discuss about the puzzles, but without giving the solutions please !!!

Re: The roman hackerus

Postby win4t4 » Wed Feb 09, 2011 11:49 pm

Just need few thing for confirmation :
1. Is there always an answer for the encrypted message ?
2. If the message length is 12. Can the key (col) be 1 or 12 ?

Because I already few times and always get incorrect result. I already checked my code and I think only 2 condition where my code give wrong answer.

Winata
User avatar
win4t4
 
Posts: 4
Joined: Mon Jan 17, 2011 7:50 am

Re: The roman hackerus

Postby admin » Thu Feb 10, 2011 12:34 am

The size won't be 1 nor will it be the size of the message.
So there must be a different problem ?
User avatar
admin
Site Admin
 
Posts: 333
Joined: Thu Dec 23, 2010 1:27 am

Re: The roman hackerus

Postby Ankit Gangal » Thu Feb 10, 2011 7:37 am

which of these cases can be there?
Welcome to coder charts...
Welcome to coder charts.
Welcome to coder charts
Welcome to coder charts. Can you break this code
Welcome to coder charts. Can you break this code.
Welcome to coder charts. Can you break this code...

can it be possible that a statement ends without a full stop (is should be possible according to me). is it also possible that there can be more than a single sentence as shown in example 4 and onwards?
User avatar
Ankit Gangal
 
Posts: 4
Joined: Sat Jan 22, 2011 8:27 am
Location: rp-111, vidya vihar, bits pilani, pilani, rajasthan, india

Re: The roman hackerus

Postby admin » Thu Feb 10, 2011 10:50 am

The "." are extra padding at the end (see the Roman Cipher) to make the message fit on the rows and columns. In Roman Hackerus, all "." appearing at the end of the decoded message are removed (and only from the end) since they are considered as padding.

Said differently the last word of a decoded message should never be followed by "."
I hope this answers your question.

Case 4 is possible, nothing in the description excludes it, case 5 and 6 are not possible (no "." after last word).
User avatar
admin
Site Admin
 
Posts: 333
Joined: Thu Dec 23, 2010 1:27 am

Re: The roman hackerus

Postby ygb » Thu Feb 10, 2011 10:14 pm

can i have the test cases ???
and i am always getting the problem of TIME Limit Exceed
please tell me solution
User avatar
ygb
 
Posts: 1
Joined: Tue Jan 25, 2011 5:49 am

Re: The roman hackerus

Postby admin » Thu Feb 10, 2011 10:46 pm

ygb

we can't give the test cases otherwise it would be all too easy.
We already say the messages are 6000 characters long and that there are 100 message per test.
The dictionary has around 200.000 words.

Try to decode this 100 times in 1 second:
Code: Select all
WOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWODEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELELERCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCO-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-CMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHA-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-TRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTO-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-COWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWO..DEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELE..RCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCR-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-..CMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEH..A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-ARTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTR..TOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTS-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S..-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-WOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOW..EDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELEL..CRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCO-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O..MCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHE..-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-TRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRT..OTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTO-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-..C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C
User avatar
admin
Site Admin
 
Posts: 333
Joined: Thu Dec 23, 2010 1:27 am

Re: The roman hackerus

Postby jivibansal » Mon Feb 14, 2011 4:44 pm

admin wrote:ygb

we can't give the test cases otherwise it would be all too easy.
We already say the messages are 6000 characters long and that there are 100 message per test.
The dictionary has around 200.000 words.

Try to decode this 100 times in 1 second:
Code: Select all
WOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWODEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELELERCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCO-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-CMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHA-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-TRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTO-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-COWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWO..DEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELE..RCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCR-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-..CMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEH..A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-ARTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTR..TOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTS-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S..-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-WOWOWOWOWOWOWOWOWOWOWOWOWOWOWOWOW..EDEDEDEDEDEDEDEDEDEDEDEDEDEDEDEDELELELELELELELELELELELELELELELELEL..CRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCRCO-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O-O..MCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHEHE..-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-TRTRTRTRTRTRTRTRTRTRTRTRTRTRTRTRT..OTOTOTOTOTOTOTOTOTOTOTOTOTOTOTOTO-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-..C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C


Ran this for the above case
Its giving
Code: Select all
WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS WELCOME TO CODER CHARTS

that too very quickly.
What should I do?
User avatar
jivibansal
 
Posts: 1
Joined: Mon Feb 14, 2011 7:16 am

Re: The roman hackerus

Postby admin » Mon Feb 14, 2011 5:59 pm

May be find a big file of words over the internet and try to use it as a dictionary. See how your code behaves with a big dictionary ?
User avatar
admin
Site Admin
 
Posts: 333
Joined: Thu Dec 23, 2010 1:27 am

Re: The roman hackerus

Postby sridhar » Mon Dec 26, 2011 12:12 am

Hi,
My code fails for Medium but clears simple and hard.
I have checked with lot of inputs it is ok even the last example input works ok
please check the output I am getting result incorrect
Thanks
User avatar
sridhar
 
Posts: 9
Joined: Thu Apr 07, 2011 4:59 am

Re: The roman hackerus

Postby sridhar » Sun Jan 01, 2012 4:16 am

Hi,

Is it possible to get an Idea why it fails on Medium Level but clears Hard and easy level

I have tried Many Inputs It works fine
Pl look into my submission and give some useful feedback

Thanks

Happy New Year to All CodeCharters


Sridhar
User avatar
sridhar
 
Posts: 9
Joined: Thu Apr 07, 2011 4:59 am

Previous

Return to Puzzles

Who is online

Users browsing this forum: Bing [Bot] and 3 guests

cron