Pagini recente » Cod sursa (job #62820) | Cod sursa (job #1714657) | Monitorul de evaluare | Cod sursa (job #43748) | Cod sursa (job #776932)
Cod sursa(job #776932)
#include<iostream>
#include <fstream>
using namespace std;
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);
int main()
{
int A[128], B[128], n, m, MAX[256];
scanf("%d",&n);
scanf("%d",&m);
for(int i=1; i<=n; i++)
scanf("%d", &A[i]);
for(int i=1; i<=m; i++)
scanf("%d", &B[i]);
int j = 1, z = 1, k = 1;
for(j=1; j<=n; j++)
for(z=1; z<=m; z++)
if(A[j] == B[z])
MAX[k++] = A[j];
--k;
printf("%d\n ", k);
for(z=1; z<=k; z++)
printf("%d", MAX[z]);
return 0;
}