Posts

Unique Birthday Gift - INFOSYS - SAMPLE QUESTION - 2

Image
 Unique Birthday Gift - INFOSYS - SAMPLE QUESTION - 2 (SOLUTION ) #include <iostream> #include <vector> #include <utility> using namespace std ; int main () { int i ; int c = 0 ; int n , k ; cin >> n ; cin >> k ; vector < pair < int , int >>v ; int j ; if ( n == 1 || k == 1 ) { int temp ; temp = n>k?n:k; cout << temp<< endl ; } else { for (i = 1 ; i <= k+ 1 ; i++) { for (j = 1 ; j <= n; j++) { pair < int , int > p = make_pair (i, j); v. push_back (p); } } for ( auto it : v) { if ( it. second % it. first == 0 ) { c++ ; } } } if (c) { cout << c << endl ; } return 0 ; }

Infosys - Monster RPG GAME Sample Question Solution

Image
Monster RPG GAME - Solution #Infosys SOLUTION    #include <iostream> #include <map> #include <algorithm> using namespace std ; void game ( map < int , int > & g , int energy ) { int c = 0 ; for ( auto & itr : g ) { if ( energy >= itr. first ) { c++; energy = energy + itr. second ; } else { continue ; } } cout << c << endl ; } void mapping ( int p [], int b [], int n , int energy ) { int count ; map < int , int > m ; // mapping the key value pair from the array int i ; for ( i = 0 ; i < n ; i++) { m. insert ({ p [i], b [i]}); } for ( auto & itr : m) { cout << itr. first << " " << itr. second << endl ; } game (m, energy ) ; } int main () { int n ; cin >> n ; int i ; int p[n] ; int b[n] ; int e ; cin >> e ; // energy i have for (i = 0 ; i < n ; i++ ) { cin >> p[i] ...

Hackerrank -- C++ - Variable Sized Array Solution

#include   < cmath > #include   < cstdio > #include   < vector > #include   < iostream > #include   < algorithm > using   namespace   std ; int   main ()   {      /* Enter your code here. Read input from STDIN. Print output to STDOUT */              int   n ,   q ;      cin   >>   n   >>   q ;      int  ** arr   =   new   int *[ n ];      for   (   int   i   =   0 ,   k   ;   i   <   n   ;   ++   i   )      {          cin   >>   k ;              ...

Hackerrank C++ -------- Array Introduction

#include   < iostream > using   namespace   std ;    int   main (){      int   n   ,   arr [ 1000 ]   ,   i   ,   j   ,   g   ;      cin >>   n   ;         g   =   n    ;             for   (   i   =   0   ;   i < n   ;   i ++)   {          cin   >>   arr [ i ]   ;        }      for   (   j   =   g - 1   ;   j   >=   0   ;   j --   ){          cout   <<   arr [ j ]   <<   " "   ;        }        return   0 ; }

Hackerrank C++ ---- Pointer

#include   < stdio.h > #include< stdlib.h > void   update ( int   * a , int   * b )   {      // Complete this function          int   tmp ;      tmp =* a +* b ;      * b = abs (* a -* b );      * a = tmp ; } int   main ()   {      int   a ,   b ;      int   * pa   =   & a ,   * pb   =   & b ;           scanf ( "%d %d" ,& a ,& b );      update ( pa , pb );      printf ( "%d\n%d" ,   a ,   b );      return   0 ; }

Hackerrank C++ --- Functions

#include <iostream> #include <cstdio> using namespace std; int main() {     int a, b, c, d;     cin>>a ; cin>> b ; cin>>c ;cin>> d ;     int   e , f ;   // variable = Expression1 ? Expression2 : Expression3   e = a>b ? a : b ;   f = c > d ? c:d ;   int  ans = e > f ? e : f ;   cout<<ans<< endl ;                return 0; }

Hacerrank C++ --- For Loop

#include   < iostream > #include   < cstdio > using   namespace   std ; int   main ()   {      // Complete the code.      int   a   ,   b    ,   g   ;      cin >>   a   ;      cin >>   b   ;        for   (   g   =   a   ;   g <= b   ;   g ++)   {          if ( g == 1 ){              cout   <<   "one"   <<   endl ;          }          else   if ( g == 2 )   {              cout   <<   "two"   <<   endl ; ...