Pagini recente » Cod sursa (job #546903) | Cod sursa (job #438681) | Cod sursa (job #2189500) | Cod sursa (job #2654612) | Cod sursa (job #2070388)
#include <fstream>
using namespace std;
int v[100002],n,m;
int Solutie0(int x)
{
int i;
for(i=n;i>=1;i--)
if(x==v[i])
return i;
return -1;
}
int Solutie1(int x)
{
int i;
for(i=n;i>=1;i--)
if(x>=v[i])
return i;
}
int Solutie2(int x)
{
int i;
for(i=1;i<=n;i++)
if(x<=v[i])
return i;
}
int main()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int i,tip,x;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>tip>>x;
if(tip==0)
fout<<Solutie0(x)<<"\n";
if(tip==1)
fout<<Solutie1(x)<<"\n";
if(tip==2)
fout<<Solutie2(x)<<"\n";
}
fin.close();
fout.close();
return 0;
}