Cod sursa(job #1280543)

Utilizator TeodorescuStefanEduardTeodorescu Stefan Eduard TeodorescuStefanEduard Data 2 decembrie 2014 07:55:49
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
    int a[1026],b[1026],c[1026],m,n,i,j,k=0;

    fstream in("cmlsc.in",ios::in);
    fstream out("cmlsc.out",ios::out);
    in>>n>>m;
    for(i=0;i<n;i++)
        in>>a[i];
    for(j=0;j<m;j++)
        in>>b[j];
    in.close();
    for(i=0;i<n;i++)
        for(j=0;j<m;j++)
            if(a[i]==b[j])
                c[k++]=b[j];
    out<<k<<"\n";
    for(i=0;i<k;i++)
        out<<c[i]<<" ";
    out.close();


    return 0;
}