Cod sursa(job #1437544)

Utilizator stefan.lupascu98Lupascu Stefan stefan.lupascu98 Data 17 mai 2015 21:52:09
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <fstream>

using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");

int main()
{
    int n, m, i, j, nr=0;
    f>>n>>m;
    int v[n+1], b[n+1];
    for(i=1; i<=n; i++)
        f>>v[i];
    for(i=1; i<=m; i++)
        f>>b[i];
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
            if(v[i]==b[j])
        {
            nr++;
            b[nr]=v[i];
        }
    }
    g<<nr<<"\n";
    for(i=1; i<=nr; i++)
        g<<b[i]<<" ";
    return 0;
}