Cod sursa(job #268405)
| Utilizator | Data | 1 martie 2009 11:18:40 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream.h>
#define max 1026
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main()
{
long m,n,i,j,k=0;
int a[max],b[max];
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])
{
k++;
}
}
}
g<<k<<"\n";
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
if(a[i]==b[j])
{
g<<a[i]<<" ";
}
}
}
return 0;
}