Search found 6 matches

by MIGXEEEL
Sat Jul 07, 2012 9:59 am
Forum: Volume 3 (300-399)
Topic: 307 - Sticks
Replies: 56
Views: 17383

Re: 307 Sticks

I know but I wanna do it with DP.
This problem is like the partition problem with n subsets isn't?
It means that is NP-Complete?
by MIGXEEEL
Sat Jun 30, 2012 10:42 pm
Forum: Volume 3 (300-399)
Topic: 307 - Sticks
Replies: 56
Views: 17383

307 Sticks

Hi everyone, I need to do this problem with DP, but I can't figure out what I have to store, or how I have to divide the problem. Here is my code, I did a DP function, but the thing is that some cases give a wrong answer, where is my mistake? import java.io.*; import java.util.*; public class Main {...
by MIGXEEEL
Mon Jun 25, 2012 6:15 pm
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4547

Re: 171 WA .... Why??

but did you use backtracking?, can you send me your code please?
by MIGXEEEL
Sun Jun 24, 2012 1:09 pm
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4547

Re: 171 WA .... Why??

how have you resolved the problem ?
by MIGXEEEL
Sun Jun 24, 2012 1:08 pm
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4547

Re: 171 - Car Trialling - WA

how have you resolved the problem?
by MIGXEEEL
Sat Jun 23, 2012 1:31 pm
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4547

171 Car Trialling

I need help with this problem, I know how can be resolved, but i don't know how to write it in a program. My idea is doing it with a grammar and a backtracking parser, when the parser can't read the word then, it's Trap!, other way is the instruction. Please, i'd aprecciate if someone that knows how...

Go to advanced search