Pagini recente » Cod sursa (job #1749045) | Cod sursa (job #502400) | Cod sursa (job #731391) | Istoria paginii runda/1. | Cod sursa (job #1769916)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
short n,m,k=1;
short a[1025],b[1025];
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++)
f>>b[i];
short c[1025];
/*for(int i=0;i<=n+m;i++)
{
if(i<=n)
c[i]=a[i];
else if(i>n)
c[i]=b[i-n];
}*/
int p = 1;
for(int i=1;i<=m;i++)
{
for(int j=p;j<=n;j++)
{if(b[i]==a[j])
{c[k]=b[i];
k++;
p = j + 1;
j = n;
}
}
}
g<<k - 1<<"\n";
for(int i=1;i<k;i++)
g<<c[i]<< " ";
return 0;
}