Cod sursa(job #2605013)

Utilizator MoarcascosminMoarcas Cosmin Moarcascosmin Data 24 aprilie 2020 11:21:06
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
#include <iostream>
/// foloseste define
using namespace std;

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

const int Max = 1025;

int N, M, A[Max], B[Max];
int s[Max], k;

void Read()
{
    f >> M >> N;

    for(int i=0; i<M; i++)
        f >> A[i];

    for(int i=0; i<N; i++)
        f >> B[i];
}

void F()
{
    for(int i=0; i<M; i++)
        for(int j=0; j<N; j++)
            if(A[i] == B[j])
                s[k++] = A[i];
}

void Display()
{
    g << k << endl;
    for(int i=0; i<k; i++)
        g << s[i] << " ";
}

int main()
{
    Read();
    F();
    Display();
    return 0;
}