I can't get AC and I don't know why
(I try to solve #318 using "single source shortest path")
Is there any tips?
Search found 4 matches
- Sat Nov 12, 2005 3:52 pm
- Forum: Volume 3 (300-399)
- Topic: 318 - Domino Effect
- Replies: 12
- Views: 10705
318 - Domino Effect
hi
I can't get AC and I don't know why
(I try to solve #318 using "single source shortest path")
Is there any tips?
I can't get AC and I don't know why
(I try to solve #318 using "single source shortest path")
Is there any tips?
- Mon Dec 15, 2003 8:56 am
- Forum: Volume 5 (500-599)
- Topic: 591 - Box of Bricks
- Replies: 80
- Views: 22946
- Mon Dec 15, 2003 7:39 am
- Forum: Volume 5 (500-599)
- Topic: 591 - Box of Bricks
- Replies: 80
- Views: 22946
:D thx a lot i stored all of the input because the sample input of #591 is 6 5 2 4 1 7 5 0 if i do it one by one the input/output will be 6 5 2 4 1 7 5 Set #1 The minimum number of moves is 5. ....0 so i stored all of them and my input/output will be 6 5 2 4 1 7 5 0 Set #1 The minimum number of move...
- Mon Dec 15, 2003 6:55 am
- Forum: Volume 5 (500-599)
- Topic: 591 - Box of Bricks
- Replies: 80
- Views: 22946
591
:-? help me! I dont understand "Output a blank line after each set" I tried printf("Set #%d\nThe minimum number of moves is %d.\n\n",i+1,min); but it didnt work i cant find the bugs! #include<stdio.h> int main(){ int n[50][50],min=0,j,k,i=0,sum=0; scanf("%d",&n [0])...