Cod sursa(job #2468225)
| Utilizator | Data | 5 octombrie 2019 13:31:43 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int M,N,p,i,k, v[1024], A[1024],B[1024];
int valid(int k)
{
for(int i=1;i<=N;i++)
if(A[k]==B[i])
return 1;
return 0;
}
void afisare()
{
g<<p<<"\n";
for(int i=1;i<=p;i++)
g<<v[i]<<" ";
g<<"\n";
}
int main()
{
f>>M>>N;
for(i=1;i<=M;i++)
f>>A[i];
for(i=1; i<=N;i++)
f>>B[i];
do
{
p++;
do
{
k++;
v[p]=A[k];
}
while(valid(k)==0);
}
while(k<M);
afisare();
return 0;
}
