Cod sursa(job #1684212)
Utilizator | Data | 10 aprilie 2016 21:30:02 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main()
{
int m,n,i,j,poz,x,v[1024],v1[1024],k=0;
f>>m>>n;
for(i=1;i<=m;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
f>>x;
for(j=1;j<=m;j++)
if(x==v[j])
{
k=k+1;
v1[k]=x;
}
}
g<<k<<endl;
for(i=1;i<=k;i++)
g<<v1[i]<<" ";
f.close();
g.close();
return 0;
}