Cod sursa(job #2048500)

Utilizator deleted_2dbcc643895c1cb0DELETED deleted_2dbcc643895c1cb0 Data 26 octombrie 2017 08:51:44
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <fstream>
#define MAX 1024
using namespace std;
int find(int v1[],int M,int el)
{
    int j;
    for (j=0; j<M; ++j)
        if (el == v1[j]) return 1;
    return 0;
}
int dup (int f[],int q,int el)
{
    int j;
    for (j=0; j<q; j++)
        if (el == f[j]) return 0;
    return 1;
}
int main ()
{
    ifstream fi("cmlsc.in");
    ofstream g("cmlsc.out");
    int N,M;
    fi >> N >> M;
    int i,v[MAX],v1[MAX];
    for (i=0; i<N; ++i)
        fi >> v[i];
    for (i=0; i<M; ++i)
        fi >> v1[i];
    int f[MAX],q=0;
    for (i=0; i<N; ++i)

        if(find(v1,M,v[i]) && dup(f,q,v[i]))
        {
            f[q] = v[i];
            ++q;
        }
    g << q << "\n";
    for (i=0; i<q; ++i)
        g << f[i] << " ";
    return 0;
}