Cod sursa(job #2395682)
Utilizator | Gaspar Robert Andrei gasparrobert95 | Data | 2 aprilie 2019 19:40:42 |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int M, N, A[1025], B[1025], C[2050];
fin >> M >> N;
int i;
for(i = 1; i <= M; ++ i)
fin >> A[i];
for(i = 1; i <= N; ++ i)
fin >> B[i];
int x;
int MAX = 0, j = 0;
for(i = 1, x = 1; x <= M; ++ x){
i = 1;
while(i <= N){
if(A[x] == B[i]){
++ j;
C[j] = A[x];
++ MAX;
++ i;
}else{
++ i;
}
}
}
fout << MAX << endl;
for(i = 1; i <= j; ++ i)
fout << C[i] << " ";
return 0;
}