Question

Cum as putea sa fac acest algoritm mai eficient?

#include

using namespace std;

int main()
{
int i,n,m,j,a=1;
cin >> n;
int x[n];
for(i=1; i<=n; i++)
cin >> x[i];
cin >> m;
int y[m];
for(j=1; j<=m; j++)
cin >> y[j];
for(j=1; j<=m; j++)
{
a=1;
for(i=1; i<=n; i++)
if(y[j]<=x[n] && y[j]>=x[1])
if(x[i]==y[j] && a==1)
{
a=0;
cout<<1<<" ";
}
if(a==1)
cout<<0<<" ";
}
return 0;
}

Answer 1

Ai solutia in atasament.

de99a50e1f9056141ebb597ea3bf6a9e.cpp