competitve programming solution here...
Valid Paths Problem Solution Code: CodeChef Solution Code #include <bits/stdc++.h> using namespace std ; #define ll long long #define f ( i , a , b ) for ( int i = a; i < b; i ++ ) #define mod 1000000007 #define mk make_pair #define uniq ( v ) (v). erase ( unique ( all (v)), (v). end ()) #define ff first #define ss second #define rf ( i , a , b ) for ( int i = a;i >= b;i -- ) #define sc ( a ) scanf ( " %lld " , & a) #define pf printf #define sz ( a ) ( int )(a. size ()) #define psf push_front #define ppf pop_front #define ppb pop_back #define pb push_back #define pq priority_queue #define all ( s ) s. begin (),s. end () #define sp ( a ) setprecision (a)...
Comments
Post a Comment