Cod sursa(job #2547661)

Utilizator LansiderGadalean Daniel-Bogdan Lansider Data 15 februarie 2020 15:59:55
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.55 kb
#include <iostream>
#include<fstream>
using namespace std;

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

int main()
{
    int n,m,a[10025],b[10025],c[10025];
    fin>>m>>n;
    for(int i=1;i<=m;i++)
        fin>>a[i];
    for(int i=1;i<=n;i++)
        fin>>b[i];
    int d=0;
    for(int i=1;i<=m;i++){
        for(int j=1;j<=n;j++){
            if(a[i]==b[j]){
                d++;
                c[d]=a[i];
            }
        }
    }
    fout<<d<<'\n';
    for(int i=1;i<=d;i++)
        fout<<c[i]<<" ";
    return 0;
}