Cod sursa(job #1422884)
Utilizator | Data | 20 aprilie 2015 09:46:00 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("cifre.txt");
ofstream fo("cifre.out");
int a[1000],b[1000],y,i,n,m,j;
int main()
{fi>>n>>m;
for(i=1;i<=n;i++)
fi>>a[i];
for(j=1;j<=m;j++)
fi>>b[j];
for(i=1;i<=n;i++){
for(j=1;j<=m;j++)
if(a[i]==b[j]){y=i;fo<<a[i]<<" ";break;}}
return 0;
}