Cod sursa(job #1093259)
Utilizator | Data | 27 ianuarie 2014 21:09:08 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream.h>
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[257],b[257],m,n,k,i,j,v[256],c=0;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
k=1;
for(i=1;i<=n;i++)
{
for(j=k;j<=m;j++)
if(a[i]==b[j])
{
c++;
v[c]=b[j];
k=j;
}
}
g<<c<<'\n';
for(i=1;i<=c;i++)
g<<v[i]<<' ';
f.close();
g.close();
return 0;
}