Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- bool kiemtra(string s1, string s2)
- {
- int n = s1.size();
- int m = s2.size();
- bool ds[n + 1][m + 1];
- for (int i = 0; i <= n; i++) {
- for (int j = 0; j <= m; j++) {
- ds[i][j] = false;
- }}ds[0][0] = true;
- for (int i = 0; i < s1.size(); i++) {
- for (int j = 0; j <= s2.size(); j++) {
- if (ds[i][j]) {
- if (j < s2.size() && (toupper(s1[i]) == s2[j]))
- ds[i + 1][j + 1] = true;
- if (!isupper(s1[i]))
- ds[i + 1][j] = true;
- }}}
- return (ds[n][m]);
- }
- int main()
- {
- string s1;
- string s2;
- int n;
- cin >> n;
- for (int i = 0; i < n ;i++){
- cin>>s1>>s2;
- if (kiemtra(s1, s2))
- cout << "YES" << endl;
- else
- cout << "NO" << endl;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment