Search found 12 matches

by StanleY Yelnats
Mon Oct 23, 2006 6:23 pm
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17802

I used two priority queue however it was a WA
but the algorithm seems to be ok, i'm still working on it

( WA in 2.2sec )
by StanleY Yelnats
Wed Oct 18, 2006 9:14 pm
Forum: Volume 101 (10100-10199)
Topic: 10149 - Yahtzee
Replies: 20
Views: 11791

here's a few io : 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 1 1 1 1 6 6 6 6 6 6 6 6 1 1 1 1 1 2 2 1 1 1 2 3 1 2 3 4 5 1 2 3 4 6 6 1 2 6 6 1 4 5 5 5 5 5 5 5 6 4 4 4 5 6 3 1 3 6 3 2 2 2 4 6 4 4 4 4 4 2 2 3 6 6 4 ...
by StanleY Yelnats
Wed Oct 18, 2006 9:12 pm
Forum: Volume 101 (10100-10199)
Topic: 10149 - Yahtzee
Replies: 20
Views: 11791

it's a full house!
by StanleY Yelnats
Wed Oct 18, 2006 9:01 pm
Forum: Volume 101 (10100-10199)
Topic: 10149 - Yahtzee
Replies: 20
Views: 11791

I used hill climbing with random restart

but i had to test the maximum up to 30 times to ensure correct result

p.s what's "randomize()" equivalence in gcc?!!!
by StanleY Yelnats
Thu Oct 12, 2006 10:03 am
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32229

Emilio wrote:No, you will have n elements O((n)log(n)).
Exactly n-m+1 elements.
Each element can be of m as lenght, or you can solve it with only an array of chars and another array of char pointers.
you're absolutely right :wink:

my mistake! :oops:
by StanleY Yelnats
Wed Oct 11, 2006 8:58 am
Forum: Volume 111 (11100-11199)
Topic: 11111 - Generalized Matrioshkas
Replies: 19
Views: 10993

what's the correct output for this :

Code: Select all

-9 -1 1 9 -9 9
by StanleY Yelnats
Tue Oct 10, 2006 9:45 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32229

well with a qsort you will have m*n element which results in O((mn)log(mn))

n = string lenght
m = password lenght
by StanleY Yelnats
Tue Oct 10, 2006 9:41 pm
Forum: Volume 111 (11100-11199)
Topic: 11111 - Generalized Matrioshkas
Replies: 19
Views: 10993

my o(n) solution using stacks exceeds the time limit,
is there any faster aproach or there is something wrong about my code?
by StanleY Yelnats
Sat Oct 07, 2006 4:14 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32229

Re: 902 Password Search

Timo wrote: I think your implementation of Hashtable is wrong.
I have use Hashtable too.. and it give me AC
I used Rabin Karp method for hashing but it gave me a WA
what is your method?
by StanleY Yelnats
Sat Oct 07, 2006 4:06 pm
Forum: Volume 9 (900-999)
Topic: 918 - ASCII Mandelbrot
Replies: 11
Views: 3883

oops :oops:
thanx!
by StanleY Yelnats
Fri Oct 06, 2006 1:46 pm
Forum: Volume 9 (900-999)
Topic: 918 - ASCII Mandelbrot
Replies: 11
Views: 3883

918 - ASCII Mandelbrot

I don't know what's wrong with my code,
seems it's bigger than a precision problem
any sugestions?

Code: Select all

//ACC
by StanleY Yelnats
Wed Sep 20, 2006 8:24 pm
Forum: Volume 1 (100-199)
Topic: 146 - ID Codes
Replies: 35
Views: 5851

There is function called next_permutation() at the STL library algorithm.h
You can use that. It is just a two line program.
what's the point?

Go to advanced search