Cod sursa(job #3199836)

Utilizator TEODOR_782IOACHIMCIUC TEODOR TEODOR_782 Data 2 februarie 2024 18:37:37
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 in("cmlsc.in");
ofstream out("cmlsc.out");

int a[1000000], m, n, f = 0, v[2049];

int main()
{
    in >> m >> n;
    int j;
    for(int i = 1; i <= m + n; i++)
    {
        in >> j;
        a[j]++;
        if(a[j] == 2)
        {
            f++;
            v[f] = j;
        }
    }
    out << f;
    out << endl;
    for(int i = 1; i <= f; i++)
    {
        out << v[i] << " ";
    }
    return 0;
}