Cod sursa(job #1355299)

Utilizator maricasorinSorin-Gabriel maricasorin Data 22 februarie 2015 16:15:41
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <iostream>
#include <fstream>
#include <cstdlib>

using namespace std;

int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    int nr=0,i,j,n,m,*a,*b,*c;
    f>>n>>m;
    a=(int*)malloc(n*sizeof(int));
    b=(int*)malloc(m*sizeof(int));
    if (n>m) c=(int*)malloc(m*sizeof(int));
        else c=(int*)malloc(n*sizeof(int));
    for (i=0;i<n;i++) f>>a[i];
    for (i=0;i<m;i++) f>>b[i];
    for (i=0;i<n;i++)
        for (j=0;j<m;j++) if (a[i]==b[j]) {
            c[nr++]=a[i];
            break;
    }
    g<<nr<<endl;
    for (i=0;i<nr;i++) g<<c[i]<<" ";
    f.close();
    g.close();
    return 0;
}