Write the program to replace pi with 3.14 in string. input = pippdfpig output = 3.14ppdf3.14g

 


#include<iostream>
using namespace std;
void removepi(string a)
   {if(a.size()==0)
        {return ;}
   
   if(a[0]=='p' && a[1]=='i')
     {cout<<"3.14";
      removepi(a.substr(2));}
      else {cout<<a[0];
       removepi(a.substr(1));}        
    }

int main()
{
    string a;
     a="pippdfpig";
    removepi(a);
    return 0;
}

Comments

Post a Comment

If you have any doubt ,let me know

Popular posts from this blog

Write the program to determine the maximum possible way to reach the end from starting in game board.

Image
         #include <iostream> #include <string> using namespace std;   int maxpath( int str, int end)    {   if (str==end)            {  return 1;} //when number of blocks be lessthen no of jumps(max jump 6)      if (str>end)       {return 0;} // then this conditio n will follow satisfy.                             int count=0;          for ( int i=1;i<=6;i++)         {  count =count + maxpath(str+i,end);}       return count;        }                int main() {    int   str=1; //str = ...
Read more

FALSE POSITION METHOD

Image
  FALSE POSITION METHOD , USE : • Find root of contineous function of f(x). APPROACH : a) Find interval [a b] such that as     • f(a) and (b) must have different Signs       Somewhere in between must be Zero. b) Compute Secant between  and b*f(b)). c) Take point c which be present on Secant as well as x axis. d) Replace a or b with matching.    Sign of f(c)    Such that F (a)* F (c)<0 or   F (b)* F (c)<0  e)Repeat this_ process upto giver   iterations.   calculated C  =(a*func(b)-b*func(a))/(func(b)-func(a)); FLOWCHART of FALSE position method STEP 1)Take two points a and b , and find f(a)*f(b)<0     STEP 2) we draw Secant between f(a) and f (b) is secant         AB line is a Secant.         Now we choose C where secant cut to the X axis. STEP 3) Cheak    fu...
Read more

Write the program to arrange the n queen(queen of chessboard) in n*n matrix such that they can not ATTACK TO eachother.

Image
  OUTPUT : In form of matrix of elements (0 and 1)     where 1 is suitable position where can be keep without attack to each other.   USED : Recursion , BACKTRACKING etc CHARACTERISTICS   OF QUEEN :     A )They can move in any position in a row where it is presence.     B )They can move in any position in a column where it is presence.     C )They can move in any position in a diagonal where it is presence. CONDITION :     Arrange the queen such that they can not ATTACK to each other.     in n*n matrix       APPROCH :    A )put a queen in a row than move next row to put      the next queen in next row such that they can not ATTACK each other        After matrix 4 they are not any place where a queen can be Put without attack by anyone so BACKTRACK occur here and reach again to Matrix 1 and then continue...
Read more