Cod sursa(job #1590259)
| Utilizator | Data | 4 februarie 2016 20:20:50 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main()
{int M,N,A[1025],B[1025],i,j,p,K,max=0;
f>>M>>N;
for(i=1;i<=M;i++)
{f>>A[i];}
for(i=1;i<=N;i++)
{f>>B[i];}
for(i=1;i<=M;i++)
{K=0;
for(j=1;j<=N;j++)
{if(A[i]==B[j])
{K=1;}}
cout<<"K="<<K<<endl;
if(K==0)
{A[i]=98765;}}
for(i=1;i<=M;i++)
{if(A[i]!=98765)
{max++;}}
g<<max<<endl;
for(i=1;i<=M;i++)
{if(A[i]!=98765)
{g<<A[i]<<" ";}}
f.close();
g.close();}