Pagini recente » Cod sursa (job #1599840) | Cod sursa (job #562384) | Cod sursa (job #2148935) | Cod sursa (job #1585053) | Cod sursa (job #1051356)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[1005];
int t(int v[],int n,int x){
int m,is=1,gasit=-1;
int iend=n;
while(is<=iend&&gasit==-1){
m=(iend+is)/2;
if(v[m]==x) {gasit=m;}
else
if(x<v[m]){
iend=m-1;
}
else{
is=m+1;
}
}
while(v[gasit+1]==v[gasit]) gasit++;
return gasit;
}
int main()
{
int n,x, nrIntrebari,t;
f>>n ;
for(int i=1;i<=n;i++)f>>v[i];
f >> nrIntrebari;
f >> t >> x;
f >> t >> x;
f >> t >> x;
g<<t(v,n,x);
g << x;
g << x;
return 0;
}