Search found 44 matches

by b3yours3lf
Sat Dec 18, 2004 9:19 am
Forum: Algorithms
Topic: Algorithm site
Replies: 0
Views: 1026

Algorithm site

hai..

i'm currently dong my thesis about prim, kruskal, and dfs algorithm. i want to know where i can find tutorial about history of that algo. Like who found the algorithm, when, etc.
could someone give me some good site?

thanks in advance
by b3yours3lf
Tue Jun 15, 2004 11:11 am
Forum: Algorithms
Topic: A Game - Usaco Sec 3 problem
Replies: 2
Views: 1398

A Game - Usaco Sec 3 problem

hi,

i'm trying to solve this problem, but i don't understand what is mean by optimal strategy. is this mean player 2 always choose largest number that can be pick?

thanks for ur kind response.
by b3yours3lf
Fri May 07, 2004 3:57 pm
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 26517

195-Still WA after read all post

hi, i have passed all the input at other post, but still got WA. 1. I sort the input in oder A<a<B<b<C<c.... 2. I cleaned the input from invalid character like space, coma, etc 3. my permutation algorithm worked well for problem 10098 here's my code [c] #include <stdio.h> #include <string.h> #includ...
by b3yours3lf
Thu May 06, 2004 8:06 am
Forum: Volume 106 (10600-10699)
Topic: 10646 - What is the Card?
Replies: 17
Views: 6404

got AC-ed, thanks.
by b3yours3lf
Wed May 05, 2004 3:32 pm
Forum: Volume 106 (10600-10699)
Topic: 10646 - What is the Card?
Replies: 17
Views: 6404

10646 - What is the Card?

hi,

i think this is a straightforwad problem but i got wa for many time.
could someone give me some input output sample? or i there some tricky case?

thanks before.
by b3yours3lf
Sat Apr 24, 2004 8:10 am
Forum: Volume 3 (300-399)
Topic: 323 - Jury Compromise
Replies: 10
Views: 3331

323 - Jury Compromise

I tried to solve this problem but i can't find good dp solution, the only way i found is use 200*200 size array, but i think that's not the optimal way. it there better way to solve this problem?

thanks in advance
by b3yours3lf
Mon Oct 27, 2003 5:38 am
Forum: Volume 100 (10000-10099)
Topic: 10034 - Freckles
Replies: 101
Views: 32397

thanks for reply, Grinder, but that's not the problem...
i have make stupid mistake at the part u point..

i compare set[k] with set[e[j].v2] but value of set[e[j].v2] will change in the loop..
by b3yours3lf
Wed Oct 22, 2003 10:03 am
Forum: Volume 100 (10000-10099)
Topic: 10034 - Freckles
Replies: 101
Views: 32397

sorry, i've post wrong code, here is the correct one
[c]
--cut--
[/c]
by b3yours3lf
Wed Oct 22, 2003 7:14 am
Forum: Volume 100 (10000-10099)
Topic: 10034 - Freckles
Replies: 101
Views: 32397

10034 - Freckles

i use kruskal to solve this problem, but a got WA many times...
by b3yours3lf
Sat Oct 18, 2003 10:18 am
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 20598

but i've test in my comp (Celeron 1,1 GHZ), it's only take 2 second to find all carmichael number < 65000, but when i submitted itu (only the function to find carmichael number) i got TLE.
by b3yours3lf
Sat Oct 18, 2003 9:20 am
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 20598

10006 Time Limit Exceeded

is there a way to solve this problem without precalculate ?
by b3yours3lf
Mon Oct 06, 2003 4:04 pm
Forum: Other words
Topic: To administrator : Author Ranklist based on country
Replies: 9
Views: 2007

but we'll never know until we try..
by b3yours3lf
Mon Oct 06, 2003 9:46 am
Forum: Other words
Topic: To administrator : Author Ranklist based on country
Replies: 9
Views: 2007

To administrator : Author Ranklist based on country

There are author ranklist already, but it's difficult to know our ranklist in our country, could any features that we an show only author from one country provide?
by b3yours3lf
Sat Sep 13, 2003 8:34 am
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 13798

I still don't understand why the input #3 give output 1 2 4 1.
If we choose the best profit the output should be 2 4 3 2, right?
thanks
by b3yours3lf
Fri Sep 12, 2003 9:09 am
Forum: Volume 3 (300-399)
Topic: 306 - Cipher
Replies: 74
Views: 18487

my prog got tLE too, my algorithm same as algorithm above, find the cycle first then mod the loop form input.. here's my code [c]#include<stdio.h> #include<string.h> int same(char text[], int n) { int i; for(i=0;i<n;i++) if(text !=i+1) return 0; return 1; } main() { int nkey, key[200], loop, lp, idx...

Go to advanced search