Cod sursa(job #1002424)
Utilizator | Data | 27 septembrie 2013 18:39:27 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int n,m,i,j,a[1024],b[1024],c[1024],z;
int main()
{f>>n>>m;z=1;
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<=m;j++)
if(a[i]==b[j]){
c[z]=a[i];
z++;
}
g<<z-1<<'\n';
for(i=1;i<=z-1;i++)g<<c[i]<<" ";
return 0;
}