Cod sursa(job #899117)

Utilizator TwistedFaithStanescu Jean Alexandru TwistedFaith Data 28 februarie 2013 12:59:55
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include <iostream>
#include <fstream>
#define LMax 1026

using namespace std;
int M,N,Aux=1,A[LMax],B[LMax],C[LMax];

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int main()
{
    fin>>M>>N;

    for(int i=1;i<=M;i++)
        fin>>A[i];
    for(int i=1;i<=N;i++)
    {
        fin>>B[i];
        for(int j=1;j<=M;j++)
            if(B[i]==A[j]) C[Aux++]=B[i];
    }
    fout<<Aux-1<<'\n';
    for(int i=1;i<Aux;i++)
        fout<<C[i]<<' ';
}