Janu and Ram are close friends who task a lot about life.They go though a lot of inspiring "Quotes of Life".One fine day they had a small game.According to the game Ram will Read one of the Quote about life from the book and Jannu have to think a word about life in her mind without disclosing it to Ram.Finally once Ram completed reading the quoted Jannu will say if the word she thought in her mind is there in the Quote read by Ram.Can you convert the same scenario to a programming logic ?If the work thought by Jannu was present in the Quote then you have to print "Exists" else print "Dosen't Exists".

 #include <stdio.h>

#include <string.h>

int M,N,i,j,res;

int main()

{int t;

scanf("%d",&t);

while(t--){

 char string[100];

 char p[100];

 scanf("%s%s",string,p);

 M=strlen(p);

 N=strlen(string);

 res=0;

 for(i=0;i<=N-M;i++){

 for(j=0;j<M;j++)

 if(string[i+j]!=p[j])

 break;

 if(j==M){

 res++;

 j=0;

 }

 }

 if(res>0)printf("Exists\n");

 else printf("Dosen't Exists\n");

}




return 0;

}

Comments

Post a Comment

Popular posts from this blog

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

 #include <stdio.h> int main() {int nooffamilymembers; scanf("%d",&nooffamilymembers); int r=nooffamilymembers; for(int i=1;i<=nooffamilymembers;i++){     for(int j=1;j<=r;j++){         printf("%d ",r);     }r--;     printf("\n");} return 0; }
Read more

Mahesh has given a two-dimensional 3*3 array starting from A [0][0]. You should add the alternate elements of the array and print its sum. It should print two different numbers the first being sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 1.

 #include <stdio.h> int main() {   int A[3][3],i,j;     for(i=0;i<3;i++)     {for(j=0;j<3;j++)     {scanf("%d ",&A[i][j]);}}     int m=0,n=0;     for(i=0;i<3;i++){     for(j=0;j<3;j++){     if((i+j)%2==0)     m=m+A[i][j];     else     n=n+A[i][j];}}     printf("%d\n%d",m,n); return 0; }
Read more