Cod sursa(job #1599858)
| Utilizator | Data | 14 februarie 2016 14:28:15 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
unsigned v[1028][1028];
int main()
{
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
unsigned n,m,s=0;
f>>m>>n;
for(int i=1;i<=m;++i)
{
f>>v[0][i+1];
}
for(int i=1;i<=n;++i)
{
f>>v[i+1][0];
}
for(int i=1;i<=m;++i)
{
for(int j=1;j<=n;++j)
{
if(v[0][i+1]==v[j+1][0]) {v[i][j]=1; s++; break;}
}
}
g<<s<<"\n";
for(int i=1;i<=m;++i)
{
for(int j=1;j<=n;++j)
{
if(v[i][j]==1) g<<v[0][i+1]<<" ";
}
}
return 0;
}
