Homework 1

Author: Romanov-Fedor

task_01/src/Searching_sum.cpp

@@ -0,0 +1,17 @@
+#include "Searching_sum.hpp"
+
+#include <utility>
+
+std::pair<int, int> SearchingSum(std::vector<int> vec, int num) {
+  int start = 0;
+  int end = vec.size() - 1;
+  while (start < end) {
+    if (vec[start] + vec[end] > num)
+      end--;
+    else if (vec[start] + vec[end] < num)
+      start++;
+    else
+      return std::make_pair(start, end);
+  }
+  return std::make_pair(-1, -1);
+}

task_01/src/Searching_sum.hpp

@@ -0,0 +1,8 @@
+#ifndef SEARCHING_SUM_HPP
+#define SEARCHING_SUM_HPP
+
+#include <utility>
+#include <vector>
+std::pair<int, int> SearchingSum(std::vector<int> vec, int num);
+
+#endif  // define Searching_sum.hpp

task_01/src/main.cpp

@@ -1,3 +1,17 @@
 #include <iostream>
+#include <utility>
+#include <vector>
 
-int main() { return 0; }
+#include "Searching_sum.hpp"
+
+int main() {
+  int n, k;
+  std::cin >> n >> k;
+  std::vector<int> vec(n);
+  for (int i = 0; i < n; i++) {
+    std::cin >> vec[i];
+  }
+  std::pair<int, int> ans = SearchingSum(vec, k);
+  std::cout << ans.first << " " << ans.second << std::endl;
+  return 0;
+}

task_01/src/test.cpp

@@ -1,8 +1,44 @@
 
 #include <gtest/gtest.h>
 
-#include "topology_sort.hpp"
+#include <utility>
+#include <vector>
+
+#include "Searching_sum.hpp"
 
 TEST(TopologySort, Simple) {
-  ASSERT_EQ(1, 1);  // Stack []
+  int sum1 = 6;
+  std::vector<int> vec1{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+  std::pair<int, int> ans1{0, 6};
+  ASSERT_EQ(SearchingSum(vec1, sum1), ans1);
+
+  int sum2 = 6;
+  std::vector<int> vec2{0};
+  std::pair<int, int> ans2{-1, -1};
+  ASSERT_EQ(SearchingSum(vec2, sum2), ans2);
+
+  int sum3 = 4;
+  std::vector<int> vec3{-11, -6, 0, 1, 2, 4, 10, 16};
+  std::pair<int, int> ans3{1, 6};
+  ASSERT_EQ(SearchingSum(vec3, sum3), ans3);
+
+  int sum4 = 0;
+  std::vector<int> vec4{-17, -8, -1, 1, 2, 4, 10};
+  std::pair<int, int> ans4{2, 3};
+  ASSERT_EQ(SearchingSum(vec4, sum4), ans4);
+
+  int sum5 = -9;
+  std::vector<int> vec5{-17, -8, -1, 1, 2, 4, 10};
+  std::pair<int, int> ans5{1, 2};
+  ASSERT_EQ(SearchingSum(vec5, sum5), ans5);
+
+  int sum6 = 17;
+  std::vector<int> vec6{-17, -8, -1, 1, 2, 4, 10};
+  std::pair<int, int> ans6{-1, -1};
+  ASSERT_EQ(SearchingSum(vec6, sum6), ans6);
+
+  int sum7 = -1;
+  std::vector<int> vec7{-18, -10, -1, -1, -1, 0, 3, 5, 10};
+  std::pair<int, int> ans7{2, 5};
+  ASSERT_EQ(SearchingSum(vec7, sum7), ans7);
 }

task_01/src/topology_sort.cpp

@@ -1 +1 @@
-#include "topology_sort.hpp"
+#include "topology_sort.hpp"

task_01/src/topology_sort.hpp

@@ -1 +1 @@
-#pragma once
+#pragma once