OJ Board

This is a simple problem and thats why I am wondering why I am getting a WA here is how I work on it while ( NOT EOF ) read a complete block and save it in a vector for each line in the block process the line till the end of it or till U find a token error- if token error ignore the rest of the bloc...

by the way I am using a vector to take the input and I am using BellmanFord to calculate the path not BFS (I am testing my Bellman Ford ) and this is he code #include<iostream> #include<vector> #include<map> #include<string> using namespace std; #define oo 100000000 struct edge{ int source,dest,cost...

I am still having RunTime Error Although I am passing all the test cases on the board

can any one help please ??

this is my answer for the test cases that CDiMa has put and my code is AC :D so I think those are the right answers Case 1: 5 nodes not reachable from node 35 with TTL = 2. Case 2: 1 nodes not reachable from node 35 with TTL = 3. Case 3: 8 nodes not reachable from node 1 with TTL = 1. Case 4: 5 node...