As they said in the email, I think you are not allowed to partcipate
in the next sub-rounds if you advanced in the previous one . If you
just want try the questions, you can just do it in 'Practice mode',
but I am not sure if it will be enabled before the end of sub-rounds,
please ask away !
Rega
You are right, you have to stop the loop at value when you already
have that one in chain(in order to avoid useless repetitons) or just
stop at a value equal to one(note that 1 has the same value in all
bases: 2 ... 9) . Then you have to check if a given
number(increamentally from 2 to max_int) ha
My gcj username is 'anthonzeyi' and my nickname is 'Nzeyi' .
Cheers
--
Nzeyimana Antoine
Blog: http://nzeyi.wordpress.com
Twitter: http://www.twitter.com/nzeyi
--
'Man struggles upwards, water flows downwards' : Ren wang gaochu zou,
shui wang dichu liu .
On 9
The permutation approach is too "brute-force", and it may run in
something like O((n-1)!), which can't work easily for large inputs.
On 5/8/11, Chi Hang Leung wrote:
> I did use this approach, and this make me fail for the large set.
>
> On Sun, May 8, 2011 at 2:41 PM, anilsoni85 wrote:
>
>> Whi
If I had uploaded the wrong output file, then it should not have
granted me the points after the status was "submitted".
My biggest problem is that I was ranked with 70 points every-after I
finished the 1st three problems(for both small and large sets). But
after the 24 hours of the round, the lar
ot evaluated. It only shows as
> submitted (it shows the points because the scoreboard is "optimistic"). Only
> after the contest is your submition evaluated, and it was probably wrong.
>
> On Sun, May 8, 2011 at 9:48 PM, Nzeyimana Antoine
> wrote:
>
>> If I had uplo
ntelligent algorithms will always win, and brute force
ones may only solve small inputs.
Regards,
--
Antoine
Kigali, RW
On 5/9/11, Abdelrhman Abotaleb wrote:
> @* Nzeyimana Antoine*
> Large sets represent all possible cases but needs intelligent algorithm.
> however ; you may solve small
I wonder why his name was choosen to be Goro.
Anyway, he isn't that bad, since his worst case average run time is
"n"(if he always freeze any number that gets into the right position),
which would be "nlgn" for comparison based approaches.
On 5/10/11, Gennadiy Zlobin wrote:
> And me.
> I still th
You guys really rock!!
It's just a matter of beliefs. I believe the world will never end!!!
Remember some people take it very sereously!
Hope we pass round 1.
Welcome to Code Jam!
Antoine Nzeyimana
Kigali, Rwanda.
On May 21, 2011 1:14 AM, "Igor Naverniouk" wrote:
> Hi Robert.
>
> Thank you for
