Files
contests/Codeforces/CodeforcesRound1037(Div3)/EGCD,Unlucky!/solution.cpp

49 lines
732 B
C++

#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> pre(n), stu(n);
for (int &i : pre)
cin >> i;
for (int &i : stu)
cin >> i;
if (pre[n - 1] != stu[0]) {
cout << "NO\n";
return;
}
for (int i = 0; i < n - 1; i++) {
if (pre[i] < pre[i + 1]) {
cout << "NO\n";
return;
}
if (pre[i] % pre[i + 1] != 0) {
cout << "NO\n";
return;
}
}
for (int i = n - 1; i > 0; i--) {
if (stu[i] < stu[i - 1]) {
cout << "NO\n";
return;
}
if (stu[i] % stu[i - 1] != 0) {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
int main() {
int t;
cin >> t;
while (t--)
solve();
}