Task 1

task_01/src/main.cpp

@@ -1,3 +1,22 @@
 #include <iostream>
+#include <vector>
 
-int main() { return 0; }
+#include "utils.hpp"
+
+int main() {
+  int size;
+  std::cin >> size;
+  std::vector<int> v(size);
+  for (int i = 0; i < v.size(); i++) {
+    std::cin >> v[i];
+  }
+  int targetSum;
+  std::cin >> targetSum;
+  std::pair<int, int> ans = FindTargetSumInArray(v, targetSum);
+  if (ans.first != -1)
+    std::cout << ans.first << " " << ans.second;
+  else
+    std::cout << "Not found";
+
+  return 0;
+}

task_01/src/test.cpp

@@ -1,8 +1,33 @@
 
 #include <gtest/gtest.h>
 
-#include "topology_sort.hpp"
+#include <utility>
+#include <vector>
+
+#include "utils.hpp"
 
 TEST(TopologySort, Simple) {
-  ASSERT_EQ(1, 1);  // Stack []
-}
+  std::vector<int> v1{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+  ASSERT_EQ(FindTargetSumInArray(v1, 0), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v1, 1), std::make_pair(0, 1));
+  ASSERT_EQ(FindTargetSumInArray(v1, 9), std::make_pair(0, 9));
+  ASSERT_EQ(FindTargetSumInArray(v1, 11), std::make_pair(1, 10));
+  ASSERT_EQ(FindTargetSumInArray(v1, -5), std::make_pair(-1, -1));
+
+  std::vector<int> v2{0};
+  ASSERT_EQ(FindTargetSumInArray(v2, 0), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v2, 47), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v2, -47), std::make_pair(-1, -1));
+
+  std::vector<int> v3{-11, -6, 0, 1, 2, 4, 10, 16};
+  ASSERT_EQ(FindTargetSumInArray(v3, -6), std::make_pair(1, 2));
+  ASSERT_EQ(FindTargetSumInArray(v3, -7), std::make_pair(0, 5));
+  ASSERT_EQ(FindTargetSumInArray(v3, -8), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v3, 5), std::make_pair(0, 7));
+  ASSERT_EQ(FindTargetSumInArray(v3, 4), std::make_pair(1, 6));
+  ASSERT_EQ(FindTargetSumInArray(v3, 10), std::make_pair(1, 7));
+  ASSERT_EQ(FindTargetSumInArray(v3, -60), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v3, -12), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v3, 47), std::make_pair(-1, -1));
+  ASSERT_EQ(FindTargetSumInArray(v3, 11), std::make_pair(3, 6));
+}

task_01/src/utils.cpp

@@ -0,0 +1,14 @@
+#include "utils.hpp"
+
+std::pair<int, int> FindTargetSumInArray(std::vector<int> v, int targetSum) {
+  int i = 0, j = v.size() - 1;
+  while (v[i] < v[j]) {
+    if (v[i] + v[j] > targetSum)
+      j--;
+    else if (v[i] + v[j] < targetSum)
+      i++;
+    else
+      return std::pair<int, int>(i, j);
+  }
+  return std::pair<int, int>(-1, -1);
+}

task_01/src/utils.hpp

@@ -0,0 +1,8 @@
+#pragma once
+#include <iostream>
+#include <vector>
+// Returns pair of indices, which gives in sum target sum
+// If target sun is not presented returns pair -1; -1
+// If we target sum presented in several ways returns i, j
+// So that i is minimumal index and j is maximum index
+std::pair<int, int> FindTargetSumInArray(std::vector<int> v, int targetSum);