Cod sursa(job #757905)

Utilizator vlad060297Benchea Vlad vlad060297 Data 13 iunie 2012 19:00:18
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include <cstdio>
using namespace std;
int main()
{
freopen("cmlsc.in","r",stdin);
freopen("cmlsc.out","w",stdout);
int n,m,i,max=0,val[10];
scanf("%d %d", &n, &m);
int a[n],b[m];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<m;i++)
scanf("%d",&b[i]);
for(i=0;i<n;i++)
   for(int j=0;j<m;j++)
      if(a[i]==b[j])
      {
      val[max]=a[i];
      ++max;
      }
printf("%d\n", max);
for(i=0;i<max;i++)
printf("%d ",val[i]);
}