Cod sursa(job #631966)

Utilizator informatician28Andrei Dinu informatician28 Data 9 noiembrie 2011 23:00:00
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include<fstream> 
using namespace std; 
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int main() 
{int m,n, var, var2, v[257], u[257], x[600], i, j, var3=1, tot[500], lungime=0; 
in>>m>>n; var=m;
for(i=1;i<=m;i++) 
	{in>>v[i]; x[i]=v[i];}
for(j=1;j<=n;j++) 
	{ in>>u[j]; 
    x[var+1]=u[j]; 
	var++;
	}
	var2=m+n;
sort(x+1,x+var2+1); 
for(i=1;i<=var2;i++) 
	if(x[i]==x[i+1]) 
		{lungime++; 
	    tot[var3]=x[i]; 
		var3++;
		}
		out<<lungime<<'\n'; 
		for(i=1;i<=var3-1;i++) 
			out<<tot[i]<<" "; 
}