Cod sursa(job #1989269)
| Utilizator | Data | 6 iunie 2017 18:06:43 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
int c[1024][1024]={};
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int m,n,s=0;
f>>m>>n;
vector <int> a(m);
vector <int> b(n);
vector <int> v(0);
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<m;++i)
{
for (int j=0;j<n;++j)
{
if (a[i]==b[j])
{
s++;
c[i][j]=1;
v.push_back(a[i]);
break;
}
}
}
g<<s<<endl;
for (int i=0;i<v.size();++i) g<<v[i]<<" ";
return 0;
}
