Cod sursa(job #661355)

Utilizator adavidoaieiAdavidoaiei Dumitru-Cornel adavidoaiei Data 14 ianuarie 2012 13:08:03
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <stdio.h>

int main() {
    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);
    
    int m, n;
    int a[1024], b[1024];
    scanf("%d %d", &m, &n);
    
    for(int i = 0; i < m; i++)
            scanf("%d", &a[i]);
    
    for(int j = 0; j < n; j++)
            scanf("%d", &b[j]);
            
    int c[1024];
    int index = 0;
    bool gasit = false;
    for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                    if (a[i] == b[j]) {
                       c[index] = a[i];
                       index++;
                       gasit = true;
                    }
            }
            if (gasit == true) {
               continue;
            }
    }
    
    printf("%d\n", index);
    for (int i = 0; i < index; i++)
        printf("%d ", c[i]);
}