Cod sursa(job #1008205)

Utilizator im.teodoraTeodora Iacob im.teodora Data 10 octombrie 2013 16:59:04
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <iostream>
#include <fstream>
using namespace std;

int main()
{ int m,n,i,j,k;
  long a[1025], b[1025],v[1025];
  fstream f("cmlsc.in",ios::in);
  fstream g("cmlsc.out",ios::out);
  f>>m>>n;
  for(i=1;i<=m;i++) f>>a[i];
  for(i=1;i<=n;i++) f>>b[i];
  k=0;
  for(i=1;i<=m;i++){ for(j=1;j<=n;j++)
                              if(a[i]==b[j]&&v[k-1]!=a[i]) { k++; v[k]=a[i];  }
       }

  g<<k<<endl;
  for(i=1;i<=k;i++)
    g<<v[i]<<" ";
f.close();
g.close();
    return 0;
}