Skip to content
Open
Show file tree
Hide file tree
Changes from all 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
8 changes: 7 additions & 1 deletion task_01/src/main.cpp
Original file line number Diff line number Diff line change
@@ -1,3 +1,9 @@
#include <iostream>
#include <utility>
#include <vector>

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

using namespace std;

int main() { return 0; }
29 changes: 29 additions & 0 deletions task_01/src/task1.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
#include "task1.hpp"

#include <utility>
#include <vector>

using namespace std;
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

не приветствую использование using namespace std


pair<int, int> func(const vector<int>& arr, int Summa) {
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

плохое название функции, непонятно что она делает( и второй параметр не по кодстайлу, параметры как и переменные с маленькой_буквы_с_подчеркиванием_если_несколько_слов, и транслит не нужно использовать, просто sum

if (arr.size() < 2) {
return {-1, -1};
}

int left = 0;
int right = arr.size() - 1;

while (left < right) {
int sum = arr[left] + arr[right];

if (sum == Summa) {
return {arr[left], arr[right]};
} else if (sum < Summa) {
left++;
} else {
right--;
}
}

return {-1, -1};
}
9 changes: 9 additions & 0 deletions task_01/src/task1.hpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
#ifndef TASK1_HPP
#define TASK1_HPP

#include <utility>
#include <vector>

std::pair<int, int> func(const std::vector<int>& arr, int S);

#endif
71 changes: 69 additions & 2 deletions task_01/src/test.cpp
Original file line number Diff line number Diff line change
@@ -1,5 +1,72 @@
#include <gtest/gtest.h>

TEST(Test, Simple) {
ASSERT_EQ(1, 1); // Stack []
#include <utility>
#include <vector>

#include "task1.hpp"

using namespace std;

TEST(Task1Test, SimpleTest1) {
vector<int> arr = {2, 7, 11, 15};
int S = 9;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, 2);
EXPECT_EQ(result.second, 7);
}

TEST(Task1Test, SimpleTEst2) {
vector<int> arr = {1, 2, 4};
int S = 6;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, 2);
EXPECT_EQ(result.second, 4);
}

TEST(Task1Test, NoSolution) {
vector<int> arr = {1, 2, 3};
int S = 100;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, -1);
EXPECT_EQ(result.second, -1);
}

TEST(Task1Test, NegativeNumbers) {
vector<int> arr = {-5, -3, 0, 2, 4};
int S = -1;
pair<int, int> result = func(arr, S);
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

можно не исправлять, но если что-то не меняется то лучше сделать константой

EXPECT_EQ(result.first, -5);
EXPECT_EQ(result.second, 4);
}

TEST(Task1Test, OnlyTwo) {
vector<int> arr = {5, 10};
int S = 15;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, 5);
EXPECT_EQ(result.second, 10);
}

TEST(Task1Test, OneElement) {
vector<int> arr = {5};
int S = 5;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, -1);
EXPECT_EQ(result.second, -1);
}

TEST(Task1Test, EmptyArray) {
vector<int> arr;
int S = 10;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, -1);
EXPECT_EQ(result.second, -1);
}

TEST(Task1Test, AllNumbersSame) {
vector<int> arr = {3, 3, 3, 3};
int S = 6;
pair<int, int> result = func(arr, S);
EXPECT_EQ(result.first, 3);
EXPECT_EQ(result.second, 3);
}
4 changes: 1 addition & 3 deletions task_06/src/main.cpp
Original file line number Diff line number Diff line change
@@ -1,3 +1 @@
#include <iostream>

int main() { return 0; }
int main() { return 0; }
16 changes: 16 additions & 0 deletions task_06/src/task6.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
#include "task6.hpp"

#include <algorithm>
#include <vector>

using namespace std;

int func(int N, int K, const vector<int>& arr) {
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

тут сложность O(N*K), можно просто за O(N)

long long sum = 0;
for (int i = 0; i < N; i++) {
int start = max(0, i - K + 1);
auto mini = min_element(arr.begin() + start, arr.begin() + i + 1);
sum += *mini;
}
return sum;
}
8 changes: 8 additions & 0 deletions task_06/src/task6.hpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
#ifndef TASK6_HPP
#define TASK6_HPP

#include <vector>

int func(int N, int K, const std::vector<int>& arr);

#endif
44 changes: 41 additions & 3 deletions task_06/src/test.cpp
Original file line number Diff line number Diff line change
@@ -1,6 +1,44 @@

#include <gtest/gtest.h>

TEST(TopologySort, Simple) {
ASSERT_EQ(1, 1); // Stack []
#include <vector>

#include "task6.hpp"

using namespace std;

TEST(TopologySort, Simple) { ASSERT_EQ(1, 1); }
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

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

удали)


TEST(Task6Test, Example1) {
vector<int> prices = {5};
EXPECT_EQ(func(1, 1, prices), 5);
}

TEST(Task6Test, All_same_price) {
vector<int> prices = {4, 4, 4, 4, 4};
EXPECT_EQ(func(5, 3, prices), 20);
}

TEST(Task6Test, cheap_start) {
vector<int> prices = {2, 8, 1, 5};
EXPECT_EQ(func(4, 3, prices), 6);
}

TEST(Task6Test, full_storage) {
vector<int> prices = {5, 3, 4};
EXPECT_EQ(func(3, 3, prices), 11);
}

TEST(Task6Test, no_storage) {
vector<int> prices = {5, 3, 4};
EXPECT_EQ(func(3, 1, prices), 12);
}

TEST(Task6Test, single_day) {
vector<int> prices = {5};
EXPECT_EQ(func(1, 1, prices), 5);
}

TEST(Task6Test, siding_window) {
vector<int> prices = {3, 1, 5, 2, 4};
EXPECT_EQ(func(5, 2, prices), 9);
}
Loading