Mai intai trebuie sa te autentifici.
Cod sursa(job #1626553)
| Utilizator | Data | 3 martie 2016 10:10:57 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.82 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
int n, v[100003], m, a, b, i, j, p=0;
f>>n;
for (i=0;i<n;i++)
f>>v[i];
f>>m;
for (i=0;i<m;i++)
{
p=0;
j=0;
f>>a>>b;
if (a==0)
{
while (v[j]<=b)
{
if (v[j]==b)
p++;
j++;
}
if (p==0)
g<<-1<<'\n';
else
g<<j<<'\n';
}
if (a==1)
{
while (v[j]<=b)
j++;
g<<j<<'\n';
}
if (a==2)
{
while (v[j]<b)
j++;
g<<j+1<<'\n';
}
}
return 0;
}
