Cod sursa(job #2342979)

Utilizator x333Marian x333 Data 13 februarie 2019 16:20:44
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    int M,N;
    f>>M>>N;
    int A[M],B[N];
    int k = 0;
    int C[M > N ? N : N];
    for(int i = 0; i < M; i++)
        f>>A[i];
    for(int j  = 0; j < N; j++)
    {
        f>>B[j];
        for(int i = 0; i < M; i++)
        {
            if(B[j] == A[i])
            { int v = 0;
                for(int i = 0; i < k;i++)
                {
                   if (B[j] == C[i])
                    v = 1;
                }
                if(v == 0)
                C[k++] = B[j];
            }

        }
    }
    g<<k<<"\n";
    for(int i = 0 ; i < k; i++)
        g<<C[i]<<" ";
    return 0;
}