forked from Mohammed-Shoaib/Coding-Problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB0056.cpp
More file actions
37 lines (33 loc) · 617 Bytes
/
B0056.cpp
File metadata and controls
37 lines (33 loc) · 617 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// Problem Code: CHEFSQ
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string chefAndHisSequence(vector<int> N, vector<int> F) {
int i, j;
for(i=0, j=0 ; i<N.size() && j<F.size() ; i++)
if(N[i] == F[j])
j++;
return (j == F.size()) ? "Yes" : "No";
}
int main() {
int T, N, F, num;
vector<int> A, B;
cin >> T;
while(T--) {
cin >> N;
for(int i=0 ; i<N ; i++) {
cin >> num;
A.push_back(num);
}
cin >> F;
for(int i=0 ; i<F ; i++) {
cin >> num;
B.push_back(num);
}
cout << chefAndHisSequence(A, B) << endl;
A.clear();
B.clear();
}
return 0;
}