Cod sursa(job #2393375)

Utilizator Alex0000Alex Alex Alex0000 Data 31 martie 2019 13:27:53
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int comun[1025];
int main(){
    int lunga,lungb,i,j,c=1;
    fin>>lunga>>lungb;
    int a[lunga+1],b[lungb+1];
    for(i=1;i<=lunga;++i)
        fin>>a[i];
    for(i=1;i<=lungb;++i)
        fin>>b[i];
    for(i=1;i<=lunga;++i)
        for(j=i;j<=lungb;++j)
            if(a[i]==b[j]){
                comun[c]=a[i];
                c++;
                break;
            }
    fout<<c-1<<"\n";
    for(i=1;i<c;++i)
        fout<<comun[i]<<" ";
    return 0;
}