We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Dijkstra: Shortest Reach 2
  5. Discussions

Dijkstra: Shortest Reach 2

  • CoderSingh
     + 27 comments

    That was a good hack...All test cased passed.

    I wonder what's wrong with this code? #include using namespace std;

    int main() {

    int i;
    long l;
    long long ll;
    char c;
    float f;
    double d;
    cin>>i>>l>>ll>>c>>f>>d;
    cout<<i<<"\n"<<l<<"\n"<<ll<<"\n"<<c<<"\n"<<f<<"\n"<<d;
    return 0;
}

    First test case (testcase#0) is passed, rest are failed.