Cod sursa(job #2519144)
Utilizator | Data | 7 ianuarie 2020 12:46:01 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
int a[1025], b[1025], c[1025];
int main()
{
int n,m,i,j,p=0;
cin>>n>>m;
for (i=1; i<=n; i++)
cin>>a[i];
for (j=1; j<=m; j++)
cin>>b[j];
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
if(a[i]==b[j])
c[++p]=a[i];
cout<<p<<endl;
for (i=1; i<=p; i++)
cout<<c[i]<<" ";
}