Skip to content
Open
Show file tree
Hide file tree
Changes from 6 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions task_01/src/get_two_nums.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
#include "get_two_nums.hpp"

std::pair<long long, long long> GetTwoNums(long long number,
std::vector<long long> nums) {
if (nums.size() <= 1) {
throw std::length_error("The array size must be greater than 1.");
}
size_t left = 0;
size_t right = nums.size() - 1;
while (left != right) {
if (nums[left] + nums[right] == number)
return {nums[left], nums[right]};
else if (nums[left] + nums[right] < number)
left++;
else if (nums[left] + nums[right] > number)
right--;
}
throw std::logic_error(
"There are no two elements, which add up to a given number.");
}
7 changes: 7 additions & 0 deletions task_01/src/get_two_nums.hpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
#pragma once

#include <iostream>
#include <vector>

std::pair<long long, long long> GetTwoNums(long long number,
std::vector<long long> nums);
43 changes: 42 additions & 1 deletion task_01/src/main.cpp
Original file line number Diff line number Diff line change
@@ -1,3 +1,44 @@
#include <iostream>
#include <stdexcept>
#include <vector>

int main() { return 0; }
#include "get_two_nums.hpp"

size_t GetSize() {
size_t length;
std::cout << "Enter a length of array: ";
std::cin >> length;
if (length <= 1) {
std::cout << "You need to enter a number greater than 1\n";
GetSize();
}
return length;
};

long long GetNumber() {
long long number;
std::cout << "Enter a number: ";
std::cin >> number;
return number;
};

std::vector<long long> GetArray(size_t length) {
std::vector<long long> nums;
std::cout << "Enter the array: ";
for (int i = 0; i < length; i++) {
int number;
std::cin >> number;
nums.push_back(number);
}
return nums;
}

int main() {
long long number = GetNumber();
size_t length = GetSize();
std::vector<long long> nums = GetArray(length);
std::pair<long long, long long> res = GetTwoNums(number, nums);
std::cout << "Two numbers, which add up to a given number: " << res.first
<< ", " << res.second;
return 0;
}
82 changes: 78 additions & 4 deletions task_01/src/test.cpp
Original file line number Diff line number Diff line change
@@ -1,8 +1,82 @@

#include <gtest/gtest.h>

#include "topology_sort.hpp"
#include <iostream>
#include <stdexcept>
#include <vector>

#include "get_two_nums.hpp"

TEST(GetTwoNums, Test_1) {
ASSERT_EQ(GetTwoNums(15, std::vector<long long>{5, 10, 15, 20, 25}),
(std::pair<long long, long long>{5, 10}));
}

TEST(GetTwoNums, Test_2) {
ASSERT_EQ(
GetTwoNums(18, std::vector<long long>{1, 2, 3, 5, 7, 8, 10, 14, 19, 25}),
(std::pair<long long, long long>{8, 10}));
}

TEST(GetTwoNums, Test_3) {
ASSERT_EQ(GetTwoNums(-20, std::vector<long long>{-100, -98, -72, -54, -11, 0,
10, 20, 34, 60}),
(std::pair<long long, long long>{-54, 34}));
}

TEST(GetTwoNums, Test_4) {
ASSERT_EQ(
GetTwoNums(-6, std::vector<long long>{-120, -100, -84, -20, -11, -5, -1}),
(std::pair<long long, long long>{-5, -1}));
}

TEST(GetTwoNums, Test_5) {
ASSERT_EQ(
GetTwoNums(21000000000,
std::vector<long long>{1000000000, 2000000000, 4000000000,
8000000000, 11000000000, 13000000000}),
(std::pair<long long, long long>{8000000000, 13000000000}));
}

TEST(GetTwoNums, Test_6) {
ASSERT_EQ(
GetTwoNums(
11, std::vector<long long>{0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 2, 3,
6, 7, 8, 9, 9, 9, 12, 13, 15, 15, 16, 17}),
(std::pair<long long, long long>{2, 9}));
}

TEST(GetTwoNums, Test_7) {
ASSERT_EQ(GetTwoNums(100000000000000,
std::vector<long long>{
10000000000000, 20000000000000, 30000000000000,
30000000000000, 50000000000000, 50000000000000,
60000000000000, 110000000000000, 110000000000000,
110000000000000}),
(std::pair<long long, long long>{50000000000000, 50000000000000}));
}

TEST(GetTwoNums, Test_8) {
ASSERT_EQ(GetTwoNums(84, std::vector<long long>{-12, -6, -4, 1, 23, 25, 26,
33, 38, 46, 52, 58, 64, 69,
76, 82, 97, 101}),
(std::pair<long long, long long>{26, 58}));
}

TEST(GetTwoNums, Test_9) {
EXPECT_THROW(GetTwoNums(2, std::vector<long long>{2}), std::length_error);
}

TEST(GetTwoNums, Test_10) {
EXPECT_THROW(GetTwoNums(100, std::vector<long long>{}), std::length_error);
}

TEST(GetTwoNums, Test_11) {
EXPECT_THROW(GetTwoNums(5, std::vector<long long>{1, 2, 5, 7, 9, 11, 23, 55}),
std::logic_error);
}

TEST(TopologySort, Simple) {
ASSERT_EQ(1, 1); // Stack []
TEST(GetTwoNums, Test_12) {
EXPECT_THROW(GetTwoNums(-10, std::vector<long long>{1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14}),
std::logic_error);
}
1 change: 0 additions & 1 deletion task_01/src/topology_sort.cpp
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

переименуй файл

This file was deleted.

1 change: 0 additions & 1 deletion task_01/src/topology_sort.hpp

This file was deleted.