Pagini recente » Cod sursa (job #3249601) | Cod sursa (job #2464704) | Cod sursa (job #2588603) | Cod sursa (job #1924515) | Cod sursa (job #1240194)
#include <cstdio>
using namespace std;
int n,v[100005];
int c0(int k)
{
int i;
for (i=1;i<=n&&v[i]<k;++i);
if (v[i]==k)
return i;
return -1;
}
int c1(int k)
{
int i;
for (i=1;i<=n && v[i]<=k;++i);
return i-1;
}
int c2(int k){
int i;
for (i=1;i<=n && v[i]<k;++i);
return i;
}
int main(){
int i,m,k,t;
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;++i)
scanf("%d",&v[i]);
scanf("%d",&m);
while (m-->0)
{
scanf("%d%d",&t,&k);
if (t==0)
printf("%d\n",c0(k));
if (t==1)
printf("%d\n",c1(k));
if (t==2)
printf("%d\n",c2(k));
}
return 0;
}