Added my works from 2022

task4.h

@@ -0,0 +1,69 @@
+#include <iostream>
+#pragma once
+
+namespace task4 {
+
+	struct Node
+	{
+	public:
+		int key;
+		Node* next;
+	};
+
+	Node* newNode(int key); //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD>
+	Node* list(int size, bool print); //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
+	int sum(Node* head); //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>
+
+	int init()
+	{
+		setlocale(LC_ALL, "Russian");
+		int n; cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: "; cin >> n;
+
+		Node* array = list(n, true);
+		cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: " << sum(array);
+
+		return 0;
+	}
+
+	Node* newNode(int key)
+	{
+		Node* node = new Node;
+		node->key = key;
+		node->next = nullptr;
+		return node;
+	}
+
+	Node* list(int size, bool print)
+	{
+		Node* head = newNode(1);
+		Node* last = newNode(2);
+		head->next = last;
+
+		for (int i = 0; i < size; i++)
+		{
+			Node* node = newNode(rand());
+
+			if (print) { cout << node->key << " "; }
+
+			last->next = node;
+			last = node;
+		}
+		if (print) { cout << endl; }
+
+		return head;
+	}
+
+	int sum(Node* head)
+	{
+		int sum = 0;
+		Node* ptr = head;
+
+		while (ptr)
+		{
+			sum = sum + ptr->key;
+			ptr = ptr->next;
+		}
+
+		return sum;
+	}
+}