Cod sursa(job #2177450)

Utilizator VladP02Popescu Vlad VladP02 Data 18 martie 2018 16:49:59
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include <iostream>
#include <fstream>


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



int a[100],b[50],h=1,k,a2,b2,i,j,c;
int main()
{
    f>>a2>>b2;
    c=a2+b2;
    for(i=1;i<=c;i++)
        f>>a[i];
    for(i=1;i<=a2;i++)
    {
        for(j=a2+1;j<=c;j++)
        {
            if(a[i]==a[j]) {b[h++]=a[i]; i++; k++;}
        }
        g<<k<<"/n";
    }
    for(i=1;i<=k;i++)
        g<<b[i]<<" "<<"/b";



    return 0;
}