fork download
copy 
  1. #include <iostream>
  2. #include<string.h>
  3. #include<stdio.h>
  4. #define ll long long
  5.  
  6. using namespace std;
  7. ll k,n,i=0,t,j=0,c=0,m=0;
  8. char a[25001],b[25001];
  9. ll getn()
  10. {ll i=0;
  11.  char ch=getchar_unlocked();
  12.  while(ch>'9'||ch<'0')
  13.  ch=getchar_unlocked();
  14.  while(ch<='9'&&ch>='0')
  15.  {i=(i<<1)+(i<<3)+ch-'0';
  16.   ch=getchar_unlocked();
  17.  }
  18. return i;
  19. }
  20.  
  21.  
  22. int main()
  23. {   t=getn();
  24. for(i=0;i<t;i++){
  25. scanf("%s",a);
  26. scanf("%s",b);
  27. if(strlen(a)>strlen(b)){
  28. for(j=0;j<strlen(a);j++){
  29. if(b[0]==a[j])
  30. break;
  31. }
  32. for(k=strlen(a)-1;k>=0;k--){
  33. if(b[strlen(b)-1]==a[k])
  34. break;
  35. }
  36. for(m=0;m<strlen(b);m++){
  37. for(;j<=k;j++){
  38. if(b[m]==a[j]){
  39. c++;
  40. break;
  41. }
  42. }
  43. }
  44. if(c==strlen(b))
  45. printf("YES\n");
  46. else
  47. printf("NO\n");
  48. }
  49. if(strlen(a)<strlen(b)){
  50. for(j=0;j<strlen(b);j++){
  51. if(a[0]==b[j])
  52. break;
  53. }
  54. for(k=strlen(b)-1;k>=0;k--){
  55. if(a[strlen(a)-1]==b[k])
  56. break;
  57. }
  58. for(m=0;m<strlen(a);m++){
  59. for(;j<=k;j++){
  60. if(a[m]==b[j]){
  61. c++;
  62. break;
  63. }
  64. }
  65. }
  66. if(c==strlen(a))
  67. printf("YES\n");
  68. else
  69. printf("NO\n");
  70. }
  71. if(strlen(a)==strlen(b)){
  72. if(strcmp(a,b)==0)
  73. printf("YES\n");
  74. else
  75. printf("NO\n");
  76. }
  77. c=0;
  78. }
  79. return 0;
  80. }
Success #stdin #stdout 0s 3396KB
comments (?)
stdin
copy 
1
jjjj ajafm
stdout
copy 
YES
https://ideone.com/o0N5bx
language:
C++ (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!