## Search found 5 matches

Mon Nov 01, 2004 6:32 pm
Forum: Algorithms
Topic: I'm collecting cool graph algorithms problems
Replies: 13
Views: 4644
10239 The Book-shelver's Problem (the shortest path)
10266 Surveying (connected components)
709 Formatting Text (the shortest path)
Could you give me some hints about those problems?

I got AC on other problems in this thread, but I have exactly no idea about the three you listed.
Wed Oct 27, 2004 8:28 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 20463

### Re: no match

My AC program gives the following output for your input: [c] 3 1 4 5 5 1 5 6 7 9 7 1 5 6 8 9 10 12 6 1 5 6 10 12 14 0 1 2 1 3 2 1 3 3 1 3 5 2 1 3 2 1 3 3 2 4 7 99 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ...
Wed Apr 07, 2004 1:07 pm
Forum: Volume 7 (700-799)
Topic: 714 - Copying Books
Replies: 29
Views: 19300

### 714 Help~~

I am stuck in this problem. Anyone can help??
I tried DP and divide and conquer but these two all got TLE.
Tue Feb 03, 2004 2:38 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 19939
Finallly, I got accepted. I changed flaot to double and changed the last line to
[c]
printf( "%6.2lf%17lld\n", x, ways[ n ] );
[/c]
Fri Jan 23, 2004 4:45 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 19939

### 147 Can anyone help?

I used the same code and solved 357 and 674, but I got WA in 147. Did miss something?? :-? frustrated.... (I searched for post of 147 but I can't get the problem in my program) [c] #include <stdio.h> #define MAX 6000 long long ways[ MAX + 1 ] = { 0 }; int coins[ 11 ] = { 2000, 1000, 400, 200, 100, 4...