Code: Select all
cut after acc
EDIT: I had a typing mistake.
Search found 4 matches
- Thu Mar 15, 2007 5:20 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11152 - Colourful Flowers
- Replies: 45
- Views: 28298
- Fri Aug 11, 2006 5:33 pm
- Forum: Volume 1 (100-199)
- Topic: 121 - Pipe Fitters
- Replies: 36
- Views: 6641
or something like this:
Code: Select all
while( scanf( "%lf%lf", &a, &b ) == 2 ) ) {
//process
}
- Wed Aug 09, 2006 3:33 pm
- Forum: Volume 6 (600-699)
- Topic: 612 - DNA Sorting
- Replies: 122
- Views: 33612
612 - OLE
Hi! I tried to solve problem 612 (DNA Sorting), but I got OLE. Can someone help me?
This is my code:
sorry, i'm just stupid 
.
This is my code:
Code: Select all
CUT AFTER ACC
- Mon May 22, 2006 11:42 am
- Forum: Algorithms
- Topic: stl dijkstra
- Replies: 9
- Views: 4373
Re: Binary vs Fibonacci
Hi
I tried to run dijkstra with binary and fibonacci heap also, but I could not construct graph which provide better running time with fibonacci. The binary heap implementation steps O(E*log(N)) but it cannot be slower than the fibonacci heap implementation. I tried with big graphs also.
The ...
I tried to run dijkstra with binary and fibonacci heap also, but I could not construct graph which provide better running time with fibonacci. The binary heap implementation steps O(E*log(N)) but it cannot be slower than the fibonacci heap implementation. I tried with big graphs also.
The ...