Cod sursa(job #879718)
| Utilizator | Data | 15 februarie 2013 19:51:00 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int main()
{unsigned int n,i,m,a[1024],b[1024],c[1024],nc=0,j,k;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
fin>>n>>m;
for(i=0;i<n;i++)
fin>>a[i];
for(j=0;j<m;j++)
fin>>b[j];
for (i=0;i<n;i++)
{for(j=0;j<m;j++)
if (a[i]==b[j])
c[nc++]=b[j];
}
fout<<nc<<'\n';
for(k=0;k<nc;k++)
fout<<c[k]<<" ";
return 0;
}
