#include <iostream>
#include <string>
#include<cstdio>
#include<math.h>
#include <cmath>
#include<iomanip>
using namespace std;
#include "stdio.h"
#include "iostream"
using namespace std;
int main(int argc, char* argv[])
{
int m, n, a[9999], b[9999], i, j, k = 0, flag = 0, g = 0;
while (cin>>m)
{
g = 0;
for (i = 0; i < m; i++)
{
cin>>a[i];
}
cin>>n;
for (i = 0; i < n; i++)
{
cin>>b[i];
}
for (j = 0; j < m; j++)
printf("%d ", a[j]);
printf("\n");
for (j = 0; j < n; j++)
printf("%d ", b[j]);
printf("\n");
for (i =
BUCTOJ——算法2-1:集合union
最新推荐文章于 2024-04-30 16:46:47 发布