Search found 216 matches

by Moha
Mon Jul 24, 2006 5:17 am
Forum: Volume 106 (10600-10699)
Topic: 10650 - Determinate Prime
Replies: 67
Views: 23920

Yes, Actually it was so weird! After changing my code speed, Try to calculate all of sequences(that 162's) at the beginning and then printing them, I got it. I gon't change my sterategy for producing the sequences. But I had got WA, before that! Anyway I got it!
by Moha
Sun Jul 23, 2006 2:45 am
Forum: Volume 109 (10900-10999)
Topic: 10911 - Forming Quiz Teams
Replies: 33
Views: 16554

No All of Larry's testcase are correct. My WM-modelling was incorrect. Now I got it!
by Moha
Fri Jul 21, 2006 11:37 pm
Forum: Other words
Topic: 2007 world finals IN JAPAN?
Replies: 20
Views: 10414

That is why I think the Shanghai contest was most successful ICPC World Finals, along with good hotel, compact venue, problemset etc.
Yes I agree with you it was wonderful.
by Moha
Tue Jul 18, 2006 10:48 pm
Forum: C++
Topic: flush
Replies: 8
Views: 3226

May be the best effect of flush can be demonestrated by using cerr and cout together. cerr is unbuffer stream but cout is a buffer one.
by Moha
Sun Jul 16, 2006 12:23 am
Forum: Volume 106 (10600-10699)
Topic: 10650 - Determinate Prime
Replies: 67
Views: 23920

I passed all of these testcases but still WA, can anybody send some input and output.
by Moha
Tue Jul 11, 2006 1:20 pm
Forum: C++
Topic: <math.h> vs <cmath>
Replies: 2
Views: 1817

I think that topic didn't explain that. nevertheless, My opinion is, the problem is because of the precision. may be in your code you have used a math function such as 'abs' but its arguments type didn't equal.
by Moha
Tue Jul 11, 2006 1:03 pm
Forum: Other words
Topic: How to download the World Final Pictures
Replies: 3
Views: 2574

I have tested it, but it didn't work.
by Moha
Mon Jul 10, 2006 6:03 pm
Forum: Algorithms
Topic: Bipartite Graph Matching
Replies: 14
Views: 4517

OK, For Matching the computational complexity is O(n^3) because you need at most 'n' dfs to find the maximum matching. As I saied before, you should write a function (a dfs function) for finding the alternative path from a vertex, say V. according to bipartite graph we can save its adjcancy matrix w...
by Moha
Mon Jul 10, 2006 5:42 pm
Forum: Other words
Topic: How to download the World Final Pictures
Replies: 3
Views: 2574

How to download the World Final Pictures

Dear friends,
Can anybody tell me how to download all of the Pictures that stored in baylor site? is there any good solution for it exists?
by Moha
Sat Jul 08, 2006 11:18 pm
Forum: C++
Topic: Compiling
Replies: 6
Views: 2277

Use gdb for debuging, it is a very powerful debugger in the linux environment. You should have some practice with it to use it for debugging linux programs. Nevertheless, you can use the ddd, which is a debugger that has a gui(actually it is gdb with GUI).
by Moha
Sat Jul 08, 2006 12:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11040 - Add bricks in the wall
Replies: 9
Views: 2467

If you want to compile your code as a c code you will have some problems. because you should move up your col, row before the scanf statement.
by Moha
Fri Jul 07, 2006 1:00 am
Forum: Volume 109 (10900-10999)
Topic: 10911 - Forming Quiz Teams
Replies: 33
Views: 16554

For Larry`s testcases I got :
  • Case 1: 1472.90
    Case 2: 1275.61
    Case 3: 1293.73
    Case 4: 1173.44
    Case 5: 1094.64
Is that correct?
by Moha
Wed Jul 05, 2006 3:26 pm
Forum: Volume 109 (10900-10999)
Topic: 10911 - Forming Quiz Teams
Replies: 33
Views: 16554

I want to know is there any solution exist with Weighted matching? I think we can solve this problem easily with WM, but why the problem range is so small? am i correct?
by Moha
Tue Jul 04, 2006 5:20 pm
Forum: Algorithms
Topic: Bipartite Graph Matching
Replies: 14
Views: 4517

Do you know about alternative path theory? so if we search each vertex in the upper level, check if it is already matched or not? if it is not matched so select an edge and add this edge to the matching set, and go to the lower level, in this level you should select a matched edge, and go with it to...
by Moha
Sun Jul 02, 2006 9:21 pm
Forum: Algorithms
Topic: Bipartite Graph Matching
Replies: 14
Views: 4517

If you mean, how to code the BM, I use one dfs, i send the vertex number and the part that I am on it, i.e. 0 or 1 for Up and Down. also I use 2 array, mark and match, match =j means that ith vertex in down is matched to jth vertex in the upper level. and mark =1 means that ith vertex in upper level...

Go to advanced search