fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31. string b;
  32.  
  33. //* finding whether b is present in a as subseq or not
  34.  
  35. bool consistency(int n, int m){
  36.  
  37. int i = 0, j = 0;
  38.  
  39. while(i<n && j<m){
  40. while(i<n && a[i] != b[j]) i++;
  41. if(i==n) break;
  42.  
  43. i++;
  44. j++;
  45. }
  46.  
  47. return j==m;
  48. }
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. void solve() {
  71.  
  72. cin >> a >> b;
  73. int n = a.size();
  74. int m = b.size();
  75.  
  76. cout << boolalpha << consistency(n, m) << endl;
  77.  
  78.  
  79. }
  80.  
  81.  
  82.  
  83.  
  84.  
  85. int32_t main() {
  86. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  87.  
  88. int t = 1;
  89. cin >> t;
  90. while (t--) {
  91. solve();
  92. }
  93.  
  94. return 0;
  95. }
Success #stdin #stdout 0s 5324KB
stdin
2
ahbgdc
abc
ahbgdc
axc
stdout
true
false