Pagini recente » Cod sursa (job #3223366) | Cod sursa (job #2259393) | Cod sursa (job #1981900) | Cod sursa (job #1320796) | Cod sursa (job #2265114)
#include <bits/stdc++.h>
using namespace std;
ifstream f("algoritm.in");
ofstream g("algoritm.out");
int main()
{
int i, j, n, m, v[100], a[100], k=0, p[100], nr;
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
for(j=1;j<=m;j++)
f>>a[j];
if(n>m)
{
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
{
if(a[j]==v[i])
{
p[k]=a[j];
k++;
}
}
}
else
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(v[i]==a[j])
{
p[k]=v[i];
k++;
}
}
}
g<<k<<endl;
for(i=0;i<k;i++)
g<<p[i]<<" ";
return 0;
}