Dijkstra: Shortest Reach 2

  • HackerRank Admin
    + 1 comment

    Code

    #include <iostream>
    #include <cstdio>
    
    using namespace std;
    
    int main() {
        float f;
        double d;
    
        cin >> f >> d;
        cout << f << "\n" << d << "\n";
    
        scanf("%f %lf", &f, &d);
        printf("%f\n%lf\n", f, d);
    
        return 0;
    }
    

    Input

    19856.992 5279235.721231465
    19856.992 5279235.721231465
    

    Output

    19857
    5.27924e+06
    19856.992188
    5279235.721231