Pagini recente » Cod sursa (job #3220736) | Cod sursa (job #2548874) | Cod sursa (job #2743885) | Cod sursa (job #2401461) | Cod sursa (job #2277680)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,N,a[101],element,M,NumarIntrebare,j;
int intrebare_0(int element)
{
for(i=1; i<=N; i++)
if(a[i]==element&&a[i+1]!=element)
return i;
return -1;
}
int intrebare_1(int element)
{
for(i=1; i<=N; i++)
if(a[i]<=element&&a[i+1]>element)
return i;
}
int intrebare_2(int element)
{
for(i=N; i>=1; i--)
if(a[i]>=element&&a[i-1]<element)
return i;
}
int main()
{
f>>N;
for(j=1; j<=N; j++)
f>>a[j];
f>>M;
for(j=1; j<=M; j++)
{
f>>NumarIntrebare>>element;
if(NumarIntrebare==0)
g<<intrebare_0(element)<<'\n';
else if(NumarIntrebare==1)
g<<intrebare_1(element)<<'\n';
else
g<<intrebare_2(element)<<'\n';
}
}