Cod sursa(job #2489742)
Utilizator | Data | 9 noiembrie 2019 11:37:56 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int a[1025], b[1025], c[1025];
int main()
{
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,i,j,p=0;
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>a[i];
for (j=1; j<=m; j++)
fin>>b[j];
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
if(a[i]==b[j])
c[++p]=a[i];
fout<<n-m<<endl;
for (i=1; i<=p; i++)
fout<<c[i]<<" ";
}