Cod sursa(job #1448416)

Utilizator gohanOvidiu Stinga gohan Data 7 iunie 2015 00:35:11
Problema Cel mai lung subsir comun Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.55 kb
#include <stdio.h>

int main()
{
	int n, m,i;
	int A[256], B[256], C[256];
	
	freopen("cmlsc.in", "r", stdin);
	freopen("cmlsc.out", "w", stdout);
	
	scanf("%d%d", &n, &m);
	
	for(i = 0; i < n; i++)
	{
		scanf("%d", &A[i]);
	}
	
	for(i = 0; i < m; i++)
	{
		scanf("%d", &B[i]);
	}
	
	int contor = 0;
	int l = 0;
	int k = 0;
	while(l < n)
	{
		for(i = 0; i < m; i++)
		{
			if(A[l] == B[i])
			{
				contor++;
				C[k] = A[l];
				k++;
				break;
			}
		}
		l++;
	}
	
	printf("%d\n", contor);
	
	for(i = 0; i < k; i++)
	{
		printf("%d ", C[i]);
	}
	
	return 0;
}