Guest User

Untitled

a guest
Jul 21st, 2018
135
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.82 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <conio.h>
  3. #include <iostream.h>
  4. #include <string.h>
  5.  
  6. void KiemTra(char s1[200],char s2[200])
  7. {
  8. int n = strlen(s1);
  9. int m = strlen(s2);
  10. int flag,count=0;
  11.  
  12. for (int i=0;i<n-m+1;i++)
  13. if(s1[i] == s2[0])
  14. {
  15. flag=1;
  16. for(int j=i;j<i+m;j++)
  17. if (s1[j] != s2[j-i])
  18. flag=0;
  19. if (flag)
  20. count++;
  21. }
  22. if (count>0)
  23. cout<<"\n Xau '"<<s2<<"' xuat hien "<<count<< " lan trong xau '"<<s1<<"'";
  24. else
  25. cout<<"\n Xau '"<<s2<<"' khong xuat hien trong xau '"<<s1<<"'";
  26. }
  27.  
  28. main ()
  29. {
  30.  
  31. char s1[200],s2[200];
  32. cout<<"Nhap xau s1 : "; gets(s1);
  33. cout<<"Nhap xau s2 : "; gets(s2);
  34. int n = strlen(s1);
  35. int m = strlen(s2);
  36.  
  37. if (n>m)
  38. KiemTra(s1,s2);
  39. else
  40. KiemTra(s2,s1);
  41.  
  42. getch();
  43. }
Add Comment
Please, Sign In to add comment