Cod sursa(job #1936488)
| Utilizator | Data | 23 martie 2017 09:50:08 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int cautbin0(int a[],int x,int n)
{
int st,dr,med,ok=0;
st=1;
dr=n;
while(st<dr)
{
med=(st+dr)/2;
if(x==a[med])
{
return med;
ok=1;
}
if(x>a[med])
st=med+1;
if(x<a[med])
dr=med-1;
}
if(ok=0)
return -1;
}
int n,m,a[100005],p,x;
int main()
{
fin>>n;
for(int i=1;i<=1;i++)
fin>>a[i];
fin>>m;
for(int i=1;i<=m;i++)
return 0;
}
