Search found 187 matches

by titid_gede
Sun Oct 17, 2004 10:40 am
Forum: Algorithms
Topic: calculate n choose k
Replies: 5
Views: 1831

a little hint : prime factorization :)
by titid_gede
Sun Aug 29, 2004 4:14 pm
Forum: Volume 106 (10600-10699)
Topic: 10698 - Football Sort
Replies: 23
Views: 7478

not case sensitive, so : TC < Td < TE
anyway it's quite annoying since i cant get AC in the contest :(
by titid_gede
Tue Jun 01, 2004 5:09 pm
Forum: Volume 106 (10600-10699)
Topic: 10645 - Menu
Replies: 12
Views: 7414

input :

Code: Select all

5 3 21
2 5
1 4
3 4
output should be:

Code: Select all

23.0
1 2 1 2 1
hope it helps.
by titid_gede
Tue May 18, 2004 5:13 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 9707

what for? your assignment? isn't that a bad idea since you cheat yourself?
by titid_gede
Mon May 10, 2004 11:56 am
Forum: Volume 106 (10600-10699)
Topic: 10647 - Optimal House Placement
Replies: 3
Views: 2334

10647 - Optimal House Placement

can you give me how to solve this problem? at first sight i think it can be solve by binary search, but since there could be possible maximum value, i'm going mad now.

-titid-
by titid_gede
Sat May 08, 2004 2:41 pm
Forum: Volume 7 (700-799)
Topic: 714 - Copying Books
Replies: 29
Views: 19308

i can see the way that this problem can be solved by binary trees. looking at the structure, it is DP problem. i think i need more explanation.
thank you very much.

-titid-
by titid_gede
Fri May 07, 2004 6:07 pm
Forum: Volume 7 (700-799)
Topic: 714 - Copying Books
Replies: 29
Views: 19308

714 - copying books, help

hi, i used something like this but got WA. let memo[left][start] define best arrangements from element start to last element with using left scribes, all element in memo initialize to -1; long long rec(int left, int start) if(memo[left][start]!!=-1) return memo[left][start]; if(left==1) { count sum ...
by titid_gede
Fri Apr 30, 2004 12:13 pm
Forum: Volume 102 (10200-10299)
Topic: 10280 - Old Wine Into New Bottles
Replies: 15
Views: 6256

i'm not sure there exist DP algo which solve this prob in reasonable time. can anyone give another hints?
by titid_gede
Sat Apr 24, 2004 11:29 am
Forum: Volume 7 (700-799)
Topic: 736 - Lost in Space
Replies: 4
Views: 2321

i guess the output should be:

(1,1) - E

i remembered when solve this problem. i think the most trickies input is like this: (where i was fail before):

Code: Select all

3
  A
BCD
E G
ABE

the result should be :

Code: Select all

ABE
not found
not :

Code: Select all

ABE
(1,1) - S
good luck, hope it helps.

-titid gede-
by titid_gede
Sun Mar 21, 2004 10:51 am
Forum: Volume 105 (10500-10599)
Topic: 10537 - The Toll! Revisited
Replies: 27
Views: 9907

did you consider if source = destination?+

-titid besar-
by titid_gede
Fri Mar 12, 2004 5:43 pm
Forum: Volume 102 (10200-10299)
Topic: 10280 - Old Wine Into New Bottles
Replies: 15
Views: 6256

isnt it a subset sum problem?

regards,
titid
by titid_gede
Fri Mar 12, 2004 4:58 pm
Forum: Volume 4 (400-499)
Topic: 437 - The Tower of Babylon
Replies: 14
Views: 7864

it's a variation of Longest Increasing Subsequence (LIS) problem. try to find it. hope it helps.

regards,
titid
by titid_gede
Thu Mar 11, 2004 11:11 am
Forum: Volume 106 (10600-10699)
Topic: 10622 - Perfect P-th Powers
Replies: 47
Views: 23577

-2 ^ 6 = +64 not -64.

regards,
titid
by titid_gede
Wed Mar 10, 2004 10:41 am
Forum: Algorithms
Topic: Help about MAX Flow
Replies: 8
Views: 4189

i use ford fulkerson with DFS for augmenting path (worse than edmond -karp ) and got AC in not more than 0.4 sec. perhaps something wrong with your implementation?

regards,
titid
by titid_gede
Mon Mar 08, 2004 5:04 pm
Forum: Volume 101 (10100-10199)
Topic: 10149 - Yahtzee
Replies: 20
Views: 11517

10149 Yatzee

any hints to solve this problem?
thanks.
-titid-

Go to advanced search