Cod sursa(job #2293703)
Utilizator | Data | 1 decembrie 2018 14:38:21 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define Max 1024
int main()
{
int A[Max],B[Max],C[Max],N,M,k=0;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f>>M;
f>>N;
for(int i=0;i<M;i++)
f>>A[i];
for(int i=0;i<N;i++)
f>>B[i];
for(int i=0;i<(N<M ? M:N );i++)
{
for(int j=0;j<(N<M ? N:M);j++){
if(A[i] == B[j])
C[k++]=A[i];}
}
g<<k<<'\n';
for(int i=0;i<k;i++)
g<<C[i]<<" ";
return 0;
}