Search found 216 matches

by Moha
Thu Aug 10, 2006 1:48 pm
Forum: Volume 109 (10900-10999)
Topic: 10923 - Seven Seas
Replies: 28
Views: 11521

My code passed all of these testcases, but still WA. the problem statements says that less than 10 moves so 10th move is not correct ok?
can anybody help me?
by Moha
Thu Aug 10, 2006 12:33 pm
Forum: Volume 108 (10800-10899)
Topic: 10864 - The Predator
Replies: 5
Views: 3307

Can anybody post more test cases? I got WA. but I passed all of above testcases.
EDIT: I got it at last, Thank you Cho.
by Moha
Wed Aug 09, 2006 3:12 pm
Forum: Volume 107 (10700-10799)
Topic: 10706 - Number Sequence
Replies: 34
Views: 13775

I got it at last. I test these samples in VC++ and it has some precision rounding. when i use log() to compute number`s length in gcc i should add 1e-8 to the result. what a silly mistake!
by Moha
Wed Aug 09, 2006 3:07 pm
Forum: C++
Topic: compile error, why?
Replies: 9
Views: 3188

If you use cout.setf() or cout.precision() the effects are permanent.
by Moha
Mon Aug 07, 2006 10:04 pm
Forum: Volume 107 (10700-10799)
Topic: 10706 - Number Sequence
Replies: 34
Views: 13775

My code passed all of these testcases and still WA! why? :((
by Moha
Fri Aug 04, 2006 8:45 pm
Forum: Volume 108 (10800-10899)
Topic: 10806 - Dijkstra, Dijkstra.
Replies: 24
Views: 17536

My code solved all of the posted testcases in this froum, But i got WA, can anybody post some testcase? I use min-cost maximum flow algorithm. This is my approach: I assign 1 capacity to each edge, so each edge has 1 capacity and also a length. I use a maxflow algorithm on, with a little modificatio...
by Moha
Thu Aug 03, 2006 12:11 am
Forum: Volume 108 (10800-10899)
Topic: 10807 - Prim
Replies: 31
Views: 15988

Can anybody post some testcases? I got WA. I use backtracking method on edges.
I did a very nasty bug! now i got it. :D
by Moha
Mon Jul 31, 2006 3:01 pm
Forum: Algorithms
Topic: Bipartite Graph Matching
Replies: 14
Views: 4516

Hi, the alternative path is same as augmenting. I call it alternative because for bipartite graph our path is alternative between the matched and not-matched edge. Your algorithm is ok! But remember that you use dfs for finding the augmenting path. That may be slow your code. consider this graph: v1...
by Moha
Mon Jul 31, 2006 7:53 am
Forum: Volume 108 (10800-10899)
Topic: 10860 - Many a Little makes a Mickle
Replies: 7
Views: 2713

It seems that this problem is very easy, But i can`t get it.
this is my code can anybody tell me what is wrong with it?

Code: Select all

Code removed
EDIT: ! didn't print '.' after the answer!!
by Moha
Sun Jul 30, 2006 6:35 am
Forum: Volume 108 (10800-10899)
Topic: 10856 - Recover Factorial
Replies: 17
Views: 13473

Can anybody post some testcases? My code seems to be correct but still WA.
now I got it, I didn't print the '.' !!!
by Moha
Sat Jul 29, 2006 3:03 am
Forum: Volume 100 (10000-10099)
Topic: 10072 - Bob Laptop Woolmer and Eddie Desktop Barlow
Replies: 10
Views: 3238

For those who got WA in this problem, I got AC after I sorted the output!
by Moha
Wed Jul 26, 2006 7:18 am
Forum: C++
Topic: Designing my own Big Integer class, need your suggestions :)
Replies: 4
Views: 2584

Do you compile your code as an optimized code? and what compiler do you use?
by Moha
Wed Jul 26, 2006 7:14 am
Forum: Algorithms
Topic: LCS again...help
Replies: 4
Views: 1975

Please pay attention that, this is a output oriented order. for an instance LCS(a^n,a^n). so this is a exponential output. You can speed up your code with a dynamic table. but counting them has a polynomial order.
by Moha
Wed Jul 26, 2006 12:15 am
Forum: Volume 104 (10400-10499)
Topic: 10466 - How Far?
Replies: 25
Views: 8178

Can anybody post some testcase? this problem looks very easy but i have no idea why mine is WA!
by Moha
Tue Jul 25, 2006 10:03 pm
Forum: Other words
Topic: 2007 world finals IN JAPAN?
Replies: 20
Views: 10413

This is the Iranian participation history in ACM-ICPC World Final: 2000: it was in US, One team didn't get VISA. 2001: it was in Canada. 2002: it was in US, one of the Iranian teams didn't get visa. 2003: it was in US, Both of Iranian teams didn't get visa. 2004: it was in Prague. 2005: it was in Sh...

Go to advanced search