2cufelix.cpp

Program with arrays. short algorithm

#include<math.h>
#include<iostream.h>
void main()
{
int v[20],u[20],z[20],i,j,n,p,m,k=0;
cout<<endl;
cout<<"n= ";cin>>n;
cout<<"m= ";cin>>m;
for(i=1;i<=n;i++){
		 cout<<"v["<<i<<"]= ";
		 cin>>v[i];
		 }
for(j=1;j<=m;j++){
		 cout<<"u["<<j<<"]= ";
		 cin>>u[j];
		 }
cout<<"intersectia :";
for(i=1;i<=n;i++)
	for(j=1;j<=m;j++) if (v[i]==u[j]) {k++;
					   z[k]=v[i];
					   cout<<v[i];}
cout<<endl;
cout<<"reuniunea :";
 for(i=1;i<=n;i++)
    for(p=1;p<=k;p++)	 if (v[i]==z[p]) v[i]=0;
 for(p=1;p<=k;p++)
    for(j=1;j<=m;j++)	 if (z[p]==u[j]) u[j]=0;
	for(i=1;i<=k;i++) cout<<z[i];
	for(i=1;i<=n;i++) if(v[i]!=0) cout<<v[i];
	for(j=1;j<=m;j++) if(u[j]!=0) cout<<u[j];

cout<<endl;
cout<<"diferenta dintre v[i] si u[j] :";
for(i=1;i<=n;i++)
	if(v[i]!=0) cout<<v[i];

cout<<endl;
cout<<"diferenta dintre u[j] si v[i] :";
for(j=1;j<=m;j++)
	if (u[j]!=0) cout<<u[j];
}