Pagini recente » Cod sursa (job #2619927) | Cod sursa (job #1613993) | Cod sursa (job #1869122) | Cod sursa (job #1030338) | Cod sursa (job #769625)
Cod sursa(job #769625)
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100],x,i,k,n,m,y;
int caut0(int y,int n)
{
int li,ls,ok;
ls=n;
li=1;
ok=0;
for(i=ls;i>=li;i--)
{
if(v[i]==y)
{
ok=1;
break;
}
}
if(ok==1)
return i;
else
return -1;
}
int caut1(int y,int n)
{
int li,ls;
ls=n;
li=1;
for(i=ls;i>=li;i--)
{
if(v[i]<=y)
{
break;
}
}
return i;
}
int caut2(int y,int n)
{
int li,ls;
ls=n;
li=1;
for(i=li;i<=ls;i++)
{
if(v[i]>=y)
{
break;
}
}
return i;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
while(m>0)
{
f>>x>>y;
switch(x)
{
case 0:{g<<caut0(y,n)<<"\n";break;};
case 1:{g<<caut1(y,n)<<"\n";break;};
case 2:{g<<caut2(y,n)<<"\n";break;};
}
m--;
}
f.close();
g.close();
return 0;
}