Cod sursa(job #2827828)
| Utilizator | Data | 6 ianuarie 2022 14:34:15 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
const int MAX_M_N = 1025;
int a[MAX_M_N], b[MAX_M_N];
int aparitii;
int main()
{
int n, m;
fin >> n >> m;
for(int i = 1; i <= n; i ++)
fin >> a[i];
for(int i = 1; i <= m; i ++)
fin >> b[i];
for(int i = 1; i <= m; i ++)
for(int j = 1; j <= n; j ++)
if(b[i] == a[j])
aparitii ++;
fout << aparitii;
return 0;
}
