Cod sursa(job #772495)
Utilizator | Damian Alexandru slyfer12 | Data | 29 iulie 2012 23:20:53 |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int main()
{ int n,m,a[1025],b[1025],c[1025],i,j,counter=0;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
f>>b[i];
f.close();
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i]==b[j])
{ counter++;
c[counter]=a[i];}
g<<counter<<"\n";
for(i=1;i<=counter;i++)
g<<c[i]<<" ";
g.close();
return 0;
}