Cod sursa(job #2060133)
Utilizator | Data | 7 noiembrie 2017 21:27:39 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include<fstream>
using namespace std;ifstream f("cmlsc.in");ofstream g("cmlsc.out");
int gasit(int v[],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[100],B[100],i,max=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)
max++;}
g<<max<<'\n';
for(i=1;i<=N;i++)
if (gasit(A,M,B[i])==1)
g<<B[i]<<" ";
}