Pagini recente » Cod sursa (job #681515) | Cod sursa (job #650425) | Cod sursa (job #2277565) | Borderou de evaluare (job #1330891) | Cod sursa (job #2321127)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int m, n, a[1025], b[1025], c[1025], i, j, l, rez;
f >> m >> n;
for(i=1; i<=m; i++)
f >> a[i];
for(i=1; i<=n; i++)
f >> b[i];
i = 1;
j = 1;
l = 1;
rez = 0;
while(i <= m && l <= n)
{
j = l;
while(j <= n)
{
if(a[i] == b[j])
{
rez++;
c[rez] = a[i];
i++;
j++;
l = j;
}
else
{
j++;
}
}
i++;
}
g << rez << endl;
for(i=1; i<=rez; i++)
g << c[i] << ' ';
f.close();
g.close();
return 0;
}