Search found 5 matches
- Tue Sep 26, 2006 12:02 am
- Forum: C++
- Topic: ANSI C++ Manual
- Replies: 5
- Views: 3908
- Sat Oct 22, 2005 6:03 am
- Forum: Other words
- Topic: Recommended Problems.
- Replies: 3
- Views: 2318
- Wed Oct 12, 2005 4:07 pm
- Forum: Other words
- Topic: Recommended Problems.
- Replies: 3
- Views: 2318
Recommended Problems.
Hey there! There are lots of problems on this site. Quite confused. I am preparing for the ICPC next year. Can anyone tell me which problems are really recommended to solve.
For example:
DYNAMIC:
99999
*****
***** etc,
GRAPH:
*****
Combinatorics:
*****
And also please tell me which problem ...
For example:
DYNAMIC:
99999
*****
***** etc,
GRAPH:
*****
Combinatorics:
*****
And also please tell me which problem ...
- Thu Jun 30, 2005 7:31 am
- Forum: Volume 100 (10000-10099)
- Topic: 10080 - Gopher II
- Replies: 31
- Views: 26924
- Wed Jun 29, 2005 7:38 am
- Forum: Volume 100 (10000-10099)
- Topic: 10080 - Gopher II
- Replies: 31
- Views: 26924
GOT W.A plz help me
This is my solution. But i got W.A. I used Ford-Fulkerson method to find the maximum bipartite graph matching. I am just studying matching. So if I am wrong with my algorithm please let me know. Thank you
PROGRAM Gopher2_10080;
const source=401; target=402;
var
c:array [0..402,0..402] of 0..1;
x,y ...
PROGRAM Gopher2_10080;
const source=401; target=402;
var
c:array [0..402,0..402] of 0..1;
x,y ...