Cod sursa(job #2491953)

Utilizator alalal12Alalal Alalal alalal12 Data 13 noiembrie 2019 17:11:38
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>

using namespace std;

ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");

int n, m, a[1025], b[1025], c[1025], i, j, k;

int main()
{
  fin >> n >> m;
  for (i = 1; i <= n; i++)
    fin >> a[i];
  for (j = 1; j <= m; j++)
    fin >> b[j];
  for (i = 1; i <= n; i++){
    for (j = 1; j <= m; j++){
      if (n > m)
      if (a[i] == b[j] and i >= j){
        c[k] = a[i];
        k++;
      }
      if (n < m)
        if (a[i] == b[j] and i <= j){
        c[k] = a[i];
        k++;
      }
    }
  }
  fout << k << endl;
  for (i = 0; i < k; i++)
    fout << c[i] << ' ';
    return 0;
}