#include<iostream>
using namespace std;
int n;
int N[100] = { 0 };
bool find(int key)
{
for (int i = 0; i < n; i++)
{
if (N[i] == key)
return true;
}
return false;
}
int main()
{
cin >> n;
int M[100];
int i = 0;
for (; i < n; i++)
{
cin >> N[i];
}
int m; cin >> m;
int R[100]; int r = 0;
for (int j = 0; j < m; j++)
{
cin >> M[j];
}
for (int k = 0; k < i; k++)
{
cout << N[k] << " ";
}
}
1045: 集合的交运算的实现
最新推荐文章于 2024-05-21 19:48:43 发布