Cod sursa(job #2206916)
Utilizator | Data | 24 mai 2018 13:06:42 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main()
{
int a[256],b[256],i,j,nr=0,p,n,m,c[256],k=0;
f>>n>>m;
for(i=1; i<=n; i++)
f>>a[i];
for(j=1; j<=m; j++)
f>>b[j];
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
if(a[i]==b[j])
{
nr++;
c[++k]=a[i];
}
g<<nr;
g<<endl;
for(i=1; i<=k; i++)
g<<c[i]<<" ";
f.close();
g.close();
}