Код для программы на C++

#include <algorithm>
#include <iostream>
#include <vector>
#include <random>
using namespace std;
size_t length(const char* msg) {
cout << msg;
size_t value;
cin >> value;
return value;
}
void fill(vector<int>& box) {
uniform_int_distribution<> uid(1, 9);
mt19937 gen{ random_device()() };
for (auto& x : box) x = uid(gen);
}
void show(const vector<int>& box) {
for (auto& x : box) cout << x << ' ';
puts("");
}
vector<int> intersection(const vector<int>& a, const vector<int>& b) {
auto ta = a;
sort(ta.begin(), ta.end());
auto tb = b;
sort(tb.begin(), tb.end());
vector<int> box;
set_intersection(ta.begin(), ta.end(), tb.begin(), tb.end(), back_insert_iterator(box));
return box;
}
bool equals(const vector<int>& a, const vector<int>& b) {
auto ta = a;
sort(ta.begin(), ta.end());
auto tb = b;
sort(tb.begin(), tb.end());
return ta == tb;
}
int main() {
auto n = length("N: ");
vector<int> z(n);
fill(z);
auto m = length("M: ");
vector<int> y(m);
fill(y);
auto box = intersection(z, y);
show(z);
show(y);
puts(equals(z, box) ? "TRUE" : "FALSE");
}

#include <iostream>
using namespace std;

int main()
{
int z[]{ 1,2,6,7,3,5,9,3,10,13 };
int y[]{ 2,13,3,10,7,6,9,1,3,5 };
size_t k = 0, i = 0;
size_t N = sizeof(z) / sizeof(int);
size_t M = sizeof(y) / sizeof(int);
do
{
while (z[i] != y[k] && k < M)k++;
if (k == M) {
cout << "No!"; return 0;
}
swap(y[k], y[i]);
i++; k = i;
} while (i != N);
cout << "Yes!";
}

Вариант n2:

#include <iostream>
#include <set>
using namespace std;

int main()
{
int z[]{ 1,2,6,7,3,5,9,3,10,13 };
int y[]{ 2,13,3,10,7,6,9,1,3,5 };
multiset<int>zz(z,end(z)), yy(y,end(y));
cout << (zz == yy ? "Yes!" : "No!");
}