Create Hunter.Brooks.cpp

week-8/C++/Hunter.Brooks.cpp

@@ -0,0 +1,90 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main() {
+  long long int num;
+ long long  int nque;
+  long long int q;
+   long long  int total=0;
+    vector<int> que;
+    cin >> num;
+    cin >> nque;
+for(int i=0; i <num; i++){
+long long int temp;
+cin >> temp;
+total+=temp;
+que.push_back(total);
+}
+
+    for(int i=0; i< nque;i++){
+    cin >> q;
+   long long int l=0;
+    long long int r =que.size();
+   while (l <= r) {
+          int m = (l + r) / 2;
+
+   if ( q > que[m-1] && q <= que[m] ){
+           cout << m+1 <<endl;
+           break;
+       }
+
+          // If x greater, ignore left half
+          else if (que[m] < q)
+              l = m + 1;
+
+          // If x is smaller, ignore right half
+          else
+              r = m - 1;
+      }
+
+
+    }
+
+
+
+
+}
+
+
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main() {
+    int size;
+    vector<int> arr;
+    int rep;
+    int count =1;
+    cin >> size;
+    for(int i=0; i<size; i++){
+    int temp;
+    cin >> temp;
+    arr.push_back(temp);
+    }
+    cin >> rep;
+    sort(arr.begin(),arr.end());
+    for(int j=0;j<size;j++){
+    if(arr[j]==arr[j+1])
+        count++;
+    else{
+        if(count==rep){
+        cout<<arr[j];
+        break;}
+        else
+        count=1;
+
+    }
+    }
+
+
+
+
+
+
+
+}
+