Cod sursa(job #1345139)

Utilizator BossForYOUHale Georgian-Dorin BossForYOU Data 17 februarie 2015 12:16:37
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.17 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream fi("cmlsc.in");
ofstream fo("cmlsc.out");
short int m(short int a,short int b)
{
    if (a<b) return a;
    return b;
}
void read(short int v[],short int x)
{
    for (int i=0;i<x;i++)
    {
        fi>>v[i];
    }
}
int main()
{
    short int M,N;
    fi>>M>>N;
    short int A[M],B[N],v[m(M,N)],i,j,k=0;
    read(A,M);
    read(B,N);
    if (m(M,N)==M)
    {
        for(i=0;i<N;i++)
        {
            for (j=0;j<M;j++)
            {
                if (A[j]==B[i])
                {
                    v[k]=A[j];
                    k++;
                    if (i>j) j=i;
                    else i=j;
                }
            }
        }
    }
    else
    {
        for (i=0;i<M;i++)
        {
            for (j=0;j<N;j++)
            {
                if (A[i]==B[j])
                {
                    v[k]=A[i];
                    k++;
                    if (i>j) j=i;
                    else i=j;
                }
            }
        }
    }
    fo<<k<<"\n";
    for (i=0;i<k;i++)
    {
        fo<<v[i]<<" ";
    }
    return 0;
}