Contact us

Instagram : makingcodesimple  

Comments

Post a Comment

Popular posts from this blog

HackerEarth's basic programming solutions( Ali and Helping innocent people, Duration, Book of Potion making ) :

Problem 21: Ali and Helping innocent people Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      int count ;     string s ;     cin >> s ; if (((( s [ 0 ]- '0' )+( s [ 1 ]- '0' ))% 2 == 0 )&&((( s [ 3 ]- '0' )+( s [ 4 ]- '0' ))% 2 == 0 )&&((( s [ 4 ]- '0' )+ ( s [ 5 ]- '0' ))% 2 == 0 )&&((( s [ 7 ]- '0' )+( s [ 8 ]- '0' ))% 2 == 0 )&&( s [ 2 ]!= 'A' ) &&     ( s [ 2 ]!= 'E' ) && ( s [ 2 ]!= 'I' ) && ( s [ 2 ]!= 'O' ) && ( s [ 2 ]!= 'U' ) && ( s [ 2 ]!= 'Y' ) )      {         cout << "valid" << endl ;      }      else  ...
Read more

Coursera's Algorithmic toolbox assignment solutions( Sum of Two Digits, Maximum Pairwise Product ) :

Problem 1: Sum of Two Digits Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include < bits/stdc++.h > using namespace std ; int main () { int a , b ; cin >> a >> b ; cout << a + b ; } This code is simple. There's no need for any explanation.         Problem 2: Maximum Pairwise Product Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      long long n , i ;     cin >> n ;      long long a [ n ];      for ( i = 0 ; i < n ; i ++) { cin >> a [ i ]; } sort ( a , a + n ); cout <<( a [ n - 1 ]* a [ n - 2 ]); } This code is simple. There's no need for any ...
Read more

HackerEarth's basic programming solutions( Life the Universe and Everything, Ladderophilia, Char Sum ) :

Problem 30: Life, the Universe, and Everything Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      int n ;      while ( n != 42 )      {         cin >> n ;          if ( n != 42 )         cout << n << endl ;      }      } This code is simple. There's no need for any explanation.         Problem 31:  Ladderophilia Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () { int n ; ...
Read more