Cod sursa(job #209896)

Utilizator BonnYBogdan BonnY Data 25 septembrie 2008 12:47:03
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include <iostream>
#include <fstream>
#include<stdio.h>
//#include <cstring>
//#include <cmath>
using namespace std;

int main(){
 int T=0, M=0, N=0, K=0, A[1024], B[1024], subs[256],j=0;
 ifstream iFile("cmlsc.in");
 freopen("cmlsc.out", "w", stdout);  
 iFile>>M; iFile>>N; 

 for(int i=0; i<M;i++) iFile>>A[i]; //read A
 for(int i=0; i<N;i++) iFile>>B[i]; //read B
 
 for(int i=0; i<M; i++){
  j=0;
  while(j<N){ 
   if(A[i]==B[j]) {subs[K]=B[j]; K++; j=N;}
   j++; }
 }

 printf("%d\n", K);
 for(int i=0; i<K;i++) printf("%d ", subs[i]);
 return 0;
}