Cod sursa(job #1918381)
Utilizator | Data | 9 martie 2017 15:14:13 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int n, m, i, j, x[25001], y[200001], ok;
int main()
{
cin >> n;
for(i=1;i<=n;i++)
cin >> x[i];
cin >> m;
for(j=1;j<=m;j++)
cin >> y[j];
for(j=1;j<=m;j++){
ok=1;
for(i=1;i<=n&&ok==1;i++)
if(y[j]==x[i]){
cout << 1 <<" ";
ok=0;
}
if(ok==1) cout << 0 <<" ";
}
return 0;
}