Cod sursa(job #2060217)
Utilizator | Data | 7 noiembrie 2017 23:10:56 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include<fstream>
using namespace std;ifstream f("cmlsc.in");ofstream g("cmlsc.out");
int gasit(int v[1025],int n,int x)
{
int i;
for(i=1;i<=n;i++)
{if(v[i]==x)return 1;}
return 0;
}
int main()
{
int M,N,A[1025],B[1025],C[1025],i,m=0,k=0;
f>>M>>N;
for(i=1;i<=M;i++)
f>>A[i];
for(i=1;i<=N;i++)
{f>>B[i];
if (gasit(A,M,B[i])==1)
m++;}
g<<m<<"\n";
for(i=1;i<=N;i++)
if (gasit(A,M,B[i])==1)
{
if(gasit(C,k,B[i])==0)
{
k++;C[k]=B[i];
}
}
for(i=1;i<=k;i++)
{
g<<C[i]<<" ";
}
return 0;
}