Cod sursa(job #309995)
| Utilizator | Data | 1 mai 2009 16:18:55 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream.h>
#include<iostream.h>
ifstream f("cmlsc.in") ;
ofstream g("cmlsc.out");
int n,m,a[257],b[257],i,j,k,l[257];
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i]==b[j])
{k++;
l[k]=a[i];
}
g<<k<<endl;
for(i=1;i<=k;i++)
g<<l[i]<<' ';
f.close();
g.close();
return 0;
}