Cod sursa(job #874475)

Utilizator bratiefanutBratie Fanut bratiefanut Data 8 februarie 2013 15:53:43
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>
#define nmax 1025

using namespace std;

ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");

int n,i,j,nr=0,m,a[nmax],b[nmax],c[nmax];

int main()
{
    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[i]=a[i];
    for(i=1;i<=n;i++)
    if(c[i]!=0)
    {
        nr++;
    }
    cout<<nr<<"\n";
    for(i=1;i<=n;i++)
    if(c[i]!=0)
    {
        cout<<c[i]<<' ';
    }
    return 0;
}