Cod sursa(job #419677)
Utilizator | Data | 17 martie 2010 20:12:18 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
int a[1224],b[1224],i,k=0,j,z=1,n,m,c[1025];
int main()
{ifstream f("cmlsc.in");ofstream g("cmlsc.out");
f>>m;f>>n;
for(i=1;i<=m;i++)
f>>a[i];
for(j=1;j<=n;j++)
f>>b[j];
for(i=1;i<=m;i++)
for(j=z;j<=n;j++)
if(a[i]==b[j])
{k++;z=j+1;c[k]=a[i];}
g<<k<<'\n';
for(i=1;i<=k;i++)
g<<c[i]<<" ";
return 0;}