Черных Григорий Task1 Task 2

task_01/src/findeq.cpp

@@ -0,0 +1,21 @@
+#include <findeq.hpp>
+
+pair<int , int> findeq(int goal,int length,vector<int> cont){
+    int left{0};
+    int right = cont.size() - 1;
+    while (left < right){
+        int target_sum = cont[left] + cont[right];
+
+        if (target_sum == goal){
+            return {cont[left],cont[right]};
+        }
+        else if (target_sum < goal){
+            left++;
+        }
+        else{
+            right--;
+        }
+
+    }
+    return {-1,-1};
+}

task_01/src/findeq.hpp

@@ -0,0 +1,5 @@
+#pragma once
+#include <vector>
+using namespace std;
+
+pair<int , int> findeq(int goal,int length,vector<int> cont);

task_01/src/main.cpp

@@ -1,3 +1,21 @@
 #include <iostream>
+#include <vector>
 
-int main() { return 0; }
+#include <findeq.hpp>
+
+using namespace std;
+
+
+int main() {
+
+    size_t length{0};
+    int goal{0};
+    cin >> goal;
+    cin >> length;
+    vector<int> cont(length);
+    for (int i{0}; i < length; i++){
+        cin >> cont[i];
+    }
+    auto result = findeq(goal,length,cont);
+    cout << result.first << " "<< result.second;
+     return 0; }

task_01/src/test.cpp

@@ -1,5 +1,21 @@
 #include <gtest/gtest.h>
 
-TEST(Test, Simple) {
-  ASSERT_EQ(1, 1);  // Stack []
+#include <findeq.hpp>
+#include <vector>
+
+TEST(SumOfTwo, Simple) {
+  std::vector<int> v ={ 2,7,11,15};
+  ASSERT_EQ(findeq(9,4,v),std::make_pair(2,7));  // Stack []
+}
+
+
+TEST(SumOfTwo, WrongAns) {
+  ASSERT_EQ(findeq(1000,4,{0,4,5,9}),std::make_pair(-1,-1));
+}
+TEST(SumOfTwo, EmptyCont){
+  ASSERT_EQ(findeq(10,0,{}),std::make_pair(-1,-1));
+}
+
+TEST(SumOfTwo,Hard){
+  ASSERT_EQ(findeq(100,10,{0,10,15,20,25,30,40,50,75,95}),std::make_pair(25,75));
 }

task_01/tests/no_solution.out

@@ -1 +1 @@
--1
+-1 -1

task_01/tests/single_element.out

@@ -1 +1 @@
--1
+-1 -1

task_02/src/main.cpp

@@ -1,3 +1,16 @@
 #include <iostream>
+#include <search.hpp>
 
-int main() { return 0; }
+int main() {  
+        size_t length = 0;
+        std::cin >> length;
+        std::vector<int> cont(length);
+        for (int i = 0; i < length; i++){
+            std::cin >> cont[i]; 
+        }
+
+
+        auto result = search(cont);
+        std::cout << result << std::endl;
+        return 0;
+    }

task_02/src/search.cpp

@@ -0,0 +1,23 @@
+#include "search.hpp"
+
+
+int search(std::vector<int> cont){
+    int left = 0;
+    int right = size(cont) - 1;
+    while (left <= right){
+        int middle = left + (right - left) /2;
+        if (cont[middle] == 0 && cont[middle + 1] == 1){
+            return middle;
+        }
+        else if (cont[middle] == 1 && cont[middle - 1] == 0){
+            return middle - 1;
+        }
+        else if(cont[middle] == 1){
+            right = middle -1;
+        }
+        else{
+            left = middle + 1;
+        }
+    }
+    return 0; //function shouldnt reach here but just in case
+}

task_02/src/search.hpp

@@ -0,0 +1,7 @@
+#pragma once
+
+#include <vector>
+
+
+
+int search(std::vector<int> cont);

task_02/src/test.cpp

@@ -1,5 +1,17 @@
 #include <gtest/gtest.h>
+#include <search.hpp>
 
-TEST(Test, Simple) {
-  ASSERT_EQ(1, 1);  // placeholder
+
+TEST(Test, First_elem) {
+  ASSERT_EQ(search({0,1,1,1,1}), 0);  // placeholder
+}
+
+TEST(Test, Easy) {
+  ASSERT_EQ(search({0,0,1,1,1}), 1);  // placeholder
+}
+TEST(Test, Last_elem) {
+  ASSERT_EQ(search({0,0,0,0,1}), 3);  // placeholder
+}
+TEST(Test, Hard) {
+  ASSERT_EQ(search({0,0,0,0,0,0,0,0,0,0,1,1,1,1}), 9);  // placeholder
 }