Cod sursa(job #146583)

Utilizator uta_cristianUta Cristian uta_cristian Data 1 martie 2008 21:54:22
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int m,n;
vector<int> A,B,C;
void citire()
{in>>m>>n;
 int x,i;
 for (i=0;i<m;i++)
     {in>>x;
      A.push_back(x);
     }
 for (i=0;i<n;i++)
	 {in>>x;
	  B.push_back(x);
     }
 /* afisare
 for (i=0;i<A.size();i++)
	 out<<A[i]<<" ";
 out<<endl;
 for (i=0;i<B.size();i++)
	 out<<B[i]<<" ";
 */
}
int gasit(int k)
{int i;
  for (i=0;i<C.size();i++)
	  if (C[i]==k) return 1;
 return 0;
}
void subsir()
{int i,j,nr=0;
  for (i=0;i<A.size();i++)
	  for (j=0;j<B.size();j++)
	    if (A[i]==B[j]&&(!gasit(A[i]))) {C.push_back(A[i]); nr++;}
 out<<nr<<endl;
 for (i=0;i<C.size();i++)
	 out<<C[i]<<" ";
}
int main()
{	citire();
    subsir();
	return 0;
}