Cod sursa(job #3284186)

Utilizator AlexMoto2006Motoasca Alexandru-Lucian AlexMoto2006 Data 11 martie 2025 11:12:25
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>

using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n, m;
int a[1025];
struct per{
    int a, i;
};
int b[1025];
int sir[1025];
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    for (int i = 1; i <= m; i++)
    {
        fin >> b[i];
    }
    int nr = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (a[i] == b[j])
            {
                sir[nr] = a[i];
                nr++;
                i++;
            }
        }
    }
    fout << nr - 1 << "\n";
    for (int i = 1; i < nr; i++)
    {
        fout << sir[i] << " ";
    }
    return 0;
}