Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #include<algorithm>
- using namespace std;
- int s(int a[],int x,int h)
- {
- int l=0;
- for(l=0;l<=h;l++)
- {
- if(x==a[l])
- return l;
- }
- return -1;
- }
- int main()
- {
- /*int a[1000];
- int n,x;
- int i;
- cin>>n>>x;
- for(i=0;i<n;i++)
- scanf("%d",&a[i]);
- sort(a,a+n);
- int r=s(a,x,n-1);
- cout<<r<<endl;*/
- int i,j;
- int cs=1,n,q;
- cin>>n>>q;
- while(n!=0&&q!=0)
- {
- int a[10000];
- for(i=0;i<n;i++)
- {
- cin>>a[i];
- }
- sort(a,a+n);
- printf("CASE# %d:\n",cs);
- for(j=0;j<q;j++)
- {
- int x;
- cin>>x;
- int r=s(a,x,n-1);
- // cout<<r<<endl;
- //cs++;
- if(r!=-1)
- {
- /*while(a[r]!=x)
- r--;*/
- r++;
- }
- if(r==-1)
- printf("%d not found\n",x);
- else
- printf("%d found at %d\n",x,r);
- }
- cs++;
- cin>>n>>q;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement