Cod sursa(job #1296266)
Utilizator | Data | 20 decembrie 2014 19:16:24 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int m, n, i, j, a[1025], b[1025], c[1025], k;
int main()
{
k=0;
f>>m>>n;
for(i=1;i<=m;i++)f>>a[i];
for(i=1;i<=n;i++)f>>b[i];
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
if(a[i]==b[j]){
c[++k]=a[i];
break;
}
}
}
for(i=1;i<=k;i++){
g<<c[i]<<" ";
}
return 0;
}