Cod sursa(job #1234735)

Utilizator sebinsteanuDumitriu Sebastian sebinsteanu Data 27 septembrie 2014 21:57:07
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int a[100],b[100],c[100],n,m,viz[100];
void bkt()
{
    int i,j,p=0;
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
        {
            if(a[i]==b[j]&&viz[a[i]]==0)
            {
                p++;
                c[p]=a[i];
                viz[a[i]]=1;
                i++;
            }
        }
    out<<p<<"\n";
    for(i=1;i<=p;i++)
        out<<c[i]<<" ";
}
int main()
{
    in>>m>>n;
    for(int i=1;i<=m;i++)
        in>>a[i];
    for(int i=1;i<=n;i++)
        in>>b[i];
    bkt();
    return 0;
}