Tag Take Code

UVA 10474: #include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int N,Q,c=1; while(cin>>N>>Q&&(N||Q)){ cout<<"CASE# "<<c++<<':'<<endl; vector<int> vect(N); for(int i=0;i<N;i++){ cin>>vect[i]; } sort(vect.begin(),vect.end()); for(int i=0;i<Q;i++){ int s=0,e=N,a,q; cin>>q; int p=N,k=50; while(k--){ a=(s+e)/2; if(q==vect[a]){ if(p>a){ p=a; } }if(s==a||a==e){ if(p<N){ cout<<q<<" found at "<<p+1<<endl; }else{ cout<<q<<" not found"<<endl; }break; } else if(q>vect[a]){ s=a; }else if(q<=vect[a]){ e=a; } } } } return 0; }