Cod sursa(job #697935)
Utilizator | Fara nume setare333 | Data | 29 februarie 2012 11:40:45 |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[10000],b[10000],n,m;
ifstream f("ala.in");
ofstream g("ala.out");
int cauta(int x)
{
int i;
for (i=1;i<=n;i++)
if (a[i]==x)
return 1;
return 0;
}
int main()
{
int i,z,j;
f>>n>>m;
for (i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
{
f>>z;
if (cauta(z))
b[i]=z;
else
{
i--;
m--;
}
}
g<<m<<endl;
for (i=1;i<=m;i++)
g << b[i] <<" ";
return 0;
}