Cod sursa(job #3041209)
| Utilizator | Data | 31 martie 2023 10:22:30 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream F("cmlsc.in");
ofstream G("cmlsc.out");
int main()
{
int n,v[1050],m,a[1050],b[1050]; F>>n>>m;
for (int i=1;i<=n;i++)
F>>a[i];
for (int i=1;i<=m;i++)
F >>b[i];
int nr=0;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=m;j++)
{
if (a[i]==b[j])
{
nr++;
v[nr]=b[j];
}
}
}
G<<nr<<endl;
for (int i=1;i<=nr;i++)
G << v[i]<< " ";
}
