Cod sursa(job #1278660)
Utilizator | Data | 29 noiembrie 2014 10:20:51 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int i,j,m,n,a[256],b[256],k;
int main()
{f>>m>>n;
for(i=0;i<m;i++)
f>>a[i];
for(i=0;i<n;i++)
f>>b[i];
for(i=0;i<m;i++)
{k=0;
for(j=0;j<n;j++)
if(a[i]==b[j]&&k==0)
{g<<b[j]<<" ";
k=1;}
}
return 0;
}