Cod sursa(job #2445407)

Utilizator GeoeyMexicanuBadita George GeoeyMexicanu Data 3 august 2019 22:20:22
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int n,m,k,i,j,num=0;
int a[1024],b[1024];
int sols[1024];
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>a[i];
    for(i=1;i<=m;i++)
        f>>b[i];
    for(i=1;i<=n;i++)
    for(j=1;j<=m;j++){
        if(a[i] == b[j]){
            sols[num] = a[i];
            num++;
        }
    }
    g<<num<<'\n';
    for(i=0;i<num;i++)
        g<<sols[i]<<' ';
}