Dijkstra: Shortest Reach 2

  • HackerRank Admin
    + 3 comments

    For your reference, this is how problem statement teaches you to use scanf and printf:

    #include <iostream>
    #include <cstdio>
    
    using namespace std;
    
    int main() {
        int i;
        long l;
        long long ll;
        char c;
        float f;
        double d;
    
        scanf("%d %ld %lld %c %f %lf", &i, &l, &ll, &c, &f, &d);
        printf("%d\n%ld\n%lld\n%c\n%f\n%lf", i, l, ll, c, f, d);
    
        return 0;
    }