ankurcoder | Learn C++ ,Python,Java,Android,GATE topics

AccurateLee | Codeforces Round 652 (Div 2) | Code Solution C++ code given below: #include < bits / stdc ++. h > using namespace std ; int main () { int t ; cin >> t ; while ( t --) { int n ; cin >> n ; string s ; cin >> s ; int flag = 0 ; for ( int i = 0 ; i < s . length ()- 1 ; i ++) { if ( s [ i ]== '1' && s [ i + 1 ]== '0' ) { flag = 1 ; break ; } } if ( flag == 0 ) cout << s << endl ; else { for ( int i = 0 ; i < s . length (); i ++) { if ( s [ i ]== '0' ) cout << "0" ; else { cout << "0" ; break ; ...

Codeforces Round #648 (Div. 2) | C. Rotation matching Solution C++ code given below: #include < bits / stdc ++. h > using namespace std ;   int main () {   int n , a [ 200000 ], b [ 200000 ], count = 0 , dist1 , max = 0 ; cin >> n ; map < int , int > m1 , m2 , pos ; for ( int i = 1 ; i <= n ; i ++) { cin >> a [ i ]; m1 [ a [ i ]]= i ; } for ( int i = 1 ; i <= n ; i ++) { cin >> b [ i ]; m2 [ b [ i ]]= i ; } for ( int i = 1 ; i <= n ; i ++) { if ( m1 [ i ]< m2 [ i ]) { dist1 = m2 [ i ]- m1 [ i ]; pos [ dist1 ]++; if ( pos [ dist1 ]> max ) max = pos [ dist1 ]; } else { dist1 =( n - m1 [ i ])+ m2 [ i ]; pos [ dist1 ]++; if ( pos [ dist1 ]> max ) max = pos [ dist1 ];}  ...