Cod sursa(job #2325172)

Utilizator sfRaidenTufan Constantin Adrian sfRaiden Data 22 ianuarie 2019 01:18:48
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>


int main()
{

    std::ifstream fin("cmlsc.in");
    unsigned int M, N, A[1024], B[1024], C[1024];

    fin >> M >> N;

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

    for(unsigned int i = 0; i < N; i++)
        fin >> B[i];

    fin.close();

    unsigned int cnt = 0;
    for(unsigned int i = 0; i < M; i++)
        for(unsigned int j = 0; j < N; j++)
            if((A[i] == B[j]) && (A[i] && B[j]))
            {
                C[cnt] = A[i];
                A[i] = B[i] = 0;
                cnt++;
                i++;
                break;
            }

    std::ofstream fout("cmlsc.out");
    fout << cnt << "\n";
    for(unsigned int i = 0; i < cnt; i++)
        fout << C[i] << " ";
    fout.close();

    return 0;
}