Pagini recente » Cod sursa (job #1801404) | Cod sursa (job #2229882) | Cod sursa (job #2213955) | Cod sursa (job #2667287) | Cod sursa (job #2266262)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, i, v[100], m, nr, x;
int x0 (int n, int v[100], int x)
{
int st=1, dr=n, mij, poz=0;
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]<=x)
{
poz=mij;
st=mij+1;
}
else dr=mij-1;
}
if (v[poz]!=x) return -1;
return poz;
}
int x1 (int n, int v[100], int x)
{
int st=1, dr=n, mij, poz=0;
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]<=x)
{
poz=mij;
st=mij+1;
}
else dr=mij-1;
}
return poz;
}
int x2 (int n, int v[100], int x)
{
int st=1, dr=n, mij, poz=0;
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]>=x)
{
poz=mij;
dr=mij-1;
}
else st=mij+1;
}
return poz;
}
int main()
{
f>>n;
for (i=1; i<=n; i++) f>>v[i];
f>>m;
while (m!=0)
{
f>>nr>>x;
if (nr==0) g<<x0 (n, v, x)<<endl;
if (nr==1) g<<x1 (n, v, x)<<endl;
if (nr==2) g<<x2 (n, v, x)<<endl;
m--;
}
return 0;
}