Cod sursa(job #2395716)

Utilizator gasparrobert95Gaspar Robert Andrei gasparrobert95 Data 2 aprilie 2019 20:13:57
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>
using namespace std;

int main()
{
    ifstream fin("cmlsc.in");
    ofstream fout("cmlsc.out");
    int M, N;
    fin >> M >> N;
    int A[M], B[N], C[M + N];
    int i;
    for(i = 1; i <= M; ++ i)
        fin >> A[i];
    for(i = 1; i <= N; ++ i)
        fin >> B[i];
    int x = 1;
    int MAX = 0, j = 0;

    while(x <= M){
        i = 1;
    while(i <= N){
        if(A[x] == B[i]){
            ++ j;
            C[j] = B[i];
            ++ MAX;
            ++ i;
        }else{
            ++ i;
        }
    }
    ++ x;
    }
    fout << MAX << endl;
    for(i = 1; i <= MAX; ++ i)
        fout << C[i] << " ";

    return 0;
}