Cod sursa(job #1280772)
Utilizator | Teodorescu Stefan Eduard TeodorescuStefanEduard | Data | 2 decembrie 2014 14:19:21 |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#define nmax 260
using namespace std;
int main()
{
int a[nmax],b[nmax],c[nmax],m,n,i,j,k=0;
fstream in("cmlsc.in",ios::in);
fstream out("cmlsc.out",ios::out);
in>>n>>m;
for(i=0;i<n;i++)
in>>a[i];
for(j=0;j<m;j++)
in>>b[j];
in.close();
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if(a[i]==b[j])
c[k++]=b[j];
out<<k<<"\n";
for(i=0;i<k;i++)
out<<c[i]<<" ";
out.close();
return 0;
}