diff --git "a/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt" "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt"
new file mode 100644
index 0000000..e3efea8
--- /dev/null
+++ "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt"
@@ -0,0 +1,6 @@
+d = float ( input ( "D: "))
+h = float ( input ( "H: "))
+s = float ( input ( "S: "))
+m = 2*3.14*(d/2)*(2*h+(d/2))
+res = round(m/s)
+print ("rezultat=",res)
\ No newline at end of file
diff --git "a/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2652.txt" "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2652.txt"
new file mode 100644
index 0000000..207f756
--- /dev/null
+++ "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2652.txt"
@@ -0,0 +1,13 @@
+a = []
+h = 0
+n = int(input())
+for i in range(n):
+    y = int(input())
+    a.append(y) 
+for i in range(n):
+    for j in range(i+1,n):
+        if a[i] == a[j] :
+            x = 1
+if x == 0 : 
+    print("Simple")
+else : print("Not Simple")
\ No newline at end of file
diff --git "a/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2653.txt" "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2653.txt"
new file mode 100644
index 0000000..a59f9f0
--- /dev/null
+++ "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2653.txt"
@@ -0,0 +1,18 @@
+i=0
+flag=0
+mas=[]
+while (flag==0) :
+	arr=input("enter the string or '"'end'"'- ")
+	if (arr=="end") :
+		flag=1
+	else :
+		mas.append(list(map(float,arr.split())))
+		maximum=1.0
+		for j in range(len(mas[i])) :
+			if (maximum<mas[i][j]) :
+				maximum=mas[i][j]
+		for j in range(len(mas[i])) :
+			mas[i][j]/=maximum
+		i+=1
+		print ("new itteration")
+print (mas)
\ No newline at end of file
diff --git "a/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2654.txt" "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2654.txt"
new file mode 100644
index 0000000..dc64bb9
--- /dev/null
+++ "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2654.txt"
@@ -0,0 +1,11 @@
+x = int(input())
+y = x
+n = 0
+while y != 0:
+    y = y // 10
+    n += 1
+p = 0
+for i in range(n):
+    k = ((x//(10**(n-i-1)))%10)
+    p = p + k*(10**i)
+print (p)
\ No newline at end of file
diff --git "a/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2655.txt" "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2655.txt"
new file mode 100644
index 0000000..194c284
--- /dev/null
+++ "b/T1/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2655.txt"
@@ -0,0 +1,6 @@
+arr=input("enter the string - ")
+arr = arr.split()
+x=""
+for i in range(len(arr)) :
+     x+=arr[i]+"*"
+print (x)
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
new file mode 100644
index 0000000..88a7432
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
@@ -0,0 +1,55 @@
+#include <stdio.h>
+#include <array>
+
+using namespace std;
+
+void func1(int arr[10])
+{
+    printf("Function with static array result:\n");
+    for(size_t i = 0; i < 10; i++)
+    {
+        if(i % 2 == 0) arr[i] *= 2;
+        else arr[i]--;
+        printf("Array item arr[%zu]=%d\n", i, arr[i]);
+    }
+}
+
+void func2(int *arr)
+{
+    printf("Function with dinamic array result:\n");
+    for( size_t i = 0; i < 10; i++)
+    {
+        if(i % 2 == 0) arr[i] *= 2;
+        else arr[i]--;
+        printf("Array item arr[%zu]=%d\n", i, arr[i]);
+    }
+}
+
+void func3(array<int,10>& arr)
+{
+    printf("Function with std::array result:\n");
+    for( size_t i = 0; i < arr.size(); i++)
+    {
+        if(i % 2 == 0) arr[i] *= 2;
+        else arr[i]--;
+        printf("Array item arr[%zu]=%d\n", i, arr[i]);
+    }
+}
+
+int main()
+{
+    int arr1[10];
+    int *arr2 = new int[10];
+    array<int, 10> arr3;
+    srand(time(0));
+    for(size_t i = 0; i < 10; i++)
+    {
+        arr1[i] = rand() % 10;
+        arr2[i] = rand() % 100;
+        arr3[i] = rand() % 1000;
+    }
+
+    func1(arr1);
+    func2(arr2);
+    func3(arr3);
+}
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
new file mode 100644
index 0000000..988471d
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
@@ -0,0 +1,14 @@
+def isSimple(n):
+    i = 2
+    while (i*i) <= n:
+        if (n % i) == 0:
+            return False
+        i = i + 1
+    return True
+
+print "Input number (0-1000): "
+d = int(input())
+if isSimple(d) == True:
+    print "Simple number"
+else:
+    print "Number is not simple"
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2C).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2C).txt"
new file mode 100644
index 0000000..33ace8f
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2C).txt"
@@ -0,0 +1,29 @@
+#include "stdafx.h"
+#include <iostream>
+#include <array>
+using namespace std;
+
+const int num = 10;
+array <int, num> mas{};
+
+void func() {
+	int i;
+	for (i = 0; i < num; i++) {
+		if ((mas[i] % 2) == 0) mas[i] = mas[i] * 2;
+		else mas[i] = mas[i] - 1;
+		cout << mas[i] << ' ';
+	}
+}
+
+int main() {
+	int i;
+	for (i = 0; i < num; i++) {
+		mas[i] = i;
+		cout << mas[i] << ' ' << endl;
+	}
+
+	func();
+
+	cin >> i;
+	return 0;
+}
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2P).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2P).txt"
new file mode 100644
index 0000000..e82d677
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(2P).txt"
@@ -0,0 +1,15 @@
+def arithmetic(a,b,c):
+    if (c=='+') | (c=='-') | (c=='/') | (c=='*'):
+        case={
+            '+': a+b,
+            '-': a-b,
+            '*': a*b,
+            '/': a/b,
+        }
+        print(case[c])
+    else:
+        print("unknown operation")
+a = int(input("Enter a "))
+b = int(input("Enter b"))
+c = input("choose operatoin: +,-,/,*")
+arithmetic(a,b,c)
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3C).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3C).txt"
new file mode 100644
index 0000000..e57ea84
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3C).txt"
@@ -0,0 +1,21 @@
+#include<iostream>
+#include<array>
+
+int main() {
+	std::array<int, 10> mas;
+	int i = 0;
+	std::cout << "mas: ";
+	for (auto &arr : mas) {
+		arr = i;
+		std::cout << arr << " ";
+		i++;
+	}
+	std::cout << std::endl;
+	std::cout << "new mas: ";
+	for (auto &arr : mas) {
+		arr *= 2;
+		std::cout << arr << " ";
+	}
+	std::cin >> i;
+	return 0;
+}
\ No newline at end of file
diff --git "a/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3P).txt" "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3P).txt"
new file mode 100644
index 0000000..3dd0edf
--- /dev/null
+++ "b/T2/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(3P).txt"
@@ -0,0 +1,31 @@
+a=[]
+b=[]
+k=1
+n=int(input("Vvedite kolichestvo elementov:"))
+for i in range(n):
+    new = int(input("Vvedite %i element" %i))
+    a.append(new)
+print("Spisok:")
+print(a)
+for i in range(n):
+    if a[i] > 0:
+        b.append(a[i])
+j=0
+for i in b:
+    j += 1
+if j>=1:
+    print("Perviy polozhitelniy el-t:%i" %b[0])
+    k*=b[0]
+    if j>=3:
+        print("Tretiy polozhitelniy el-t:%i" %b[2])
+        k*=b[2]
+        if j>=6:
+            print("Shestoi polozhitelniy el-t:%i" %b[5])
+            k*=b[5]
+        else:
+            print("Menshe 6 polozhitelnih el-v")
+    else:
+        print("Menshe 3 polozhitelnih el-v")
+else:
+    print("Net polozhotelnih elementov")
+print("Proizvedenie: %i" %k)
\ No newline at end of file
diff --git "a/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(p.3.2).txt" "b/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(p.3.2).txt"
new file mode 100644
index 0000000..c648da6
--- /dev/null
+++ "b/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(p.3.2).txt"
@@ -0,0 +1,16 @@
+import timeit
+import random
+n = int(input())
+start_time = timeit.default_timer()
+a = []
+for i in range(n):
+    b=random.randint(1,1000)
+    a.append(b)
+for i in range(n):
+    for j in range(n):
+        if a[j]>a[i] :
+            t = a[j]
+            a[j] = a[i]
+            a[i] = t
+elapsed = timeit.default_timer() - start_time
+print(elapsed)
\ No newline at end of file
diff --git "a/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(\321\201++;3.1).txt" "b/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(\321\201++;3.1).txt"
new file mode 100644
index 0000000..3bb41df
--- /dev/null
+++ "b/T3/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(\321\201++;3.1).txt"
@@ -0,0 +1,27 @@
+#include<iostream>
+#include<chrono>
+#include<array>
+
+
+int main() {
+	std::size_t n;
+	std::cin >> n;
+	auto start = std::chrono::high_resolution_clock::now();
+	int* a = new int[n];
+	for (size_t i = 0; i < n; i++) {
+		a[i] = rand();
+	}
+	int temp;
+	for (size_t i = 0; i < n; i++) {
+		for (size_t j = i; j > 0 && a[j - 1] > a[j]; j--) {
+			temp = a[j - 1];
+			a[j - 1] = a[j];
+			a[j] = a[j - 1];
+		}
+	}
+	auto finish = std::chrono::high_resolution_clock::now();
+	std::chrono::duration<double> elapsed = finish - start;
+	std::cout << elapsed.count();
+	std::cin >> temp;
+	return 0;
+}
\ No newline at end of file
diff --git "a/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt" "b/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
new file mode 100644
index 0000000..aff03f9
--- /dev/null
+++ "b/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
@@ -0,0 +1,35 @@
+#include<iostream>
+
+int main() {
+	size_t n;
+	std::cin >> n;
+	int *a = new int[n];
+	for (int i = 0; i < n; i++) {
+		a[i] = rand();
+	}
+	for (int i = 0; i < n; i++) {
+		std::cout << a[i] << " ";
+	}
+	std::cout << std::endl;
+	int max = a[0];
+	for (int i = 0; i < n; i++) {
+		if (a[i] > max) {
+			max = a[i];
+		}
+	}
+	int *b = new int[max];
+	for (int i = 0; i < max; i++) {
+		b[i] = 0;
+	}
+	for (int i = 0; i < n; i++) {
+		b[a[i]]++;
+	}
+	for (int i = 0; i < max; i++) {
+		for (int j = 1; j <= b[i]; j++) {
+			std::cout << i << " ";
+		}
+	}
+	std::cin >> n;
+	return 0;
+	
+}
\ No newline at end of file
diff --git "a/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt" "b/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
new file mode 100644
index 0000000..00962db
--- /dev/null
+++ "b/T4/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
@@ -0,0 +1,26 @@
+import timeit
+import random
+import math
+n = int(input("Vvedi kol-vo elementov"))
+start_time = timeit.default_timer()
+a = []
+c = []
+for i in range(n):
+    new = random.randint(1,20)
+    a.append(new)
+maxV = max(a)
+minV = min(a)
+size = 4
+count = math.floor((maxV - minV) / size) + 1
+b = []
+for i in range(count):
+    b.append([])
+for i in range(n):
+    b[math.floor((a[i] - minV) / size)].append(a[i])
+for i in range(count):
+    b[i] = sorted(b[i])   
+for i in range(count):
+    for j in range(len(b[i])):
+        c.append(b[i][j])
+elapsed = timeit.default_timer() - start_time
+print(elapsed)
\ No newline at end of file
diff --git "a/T4/MSemyonov/\321\200\320\265\320\267\321\203\320\273\321\214\321\202\320\260\321\202.docx" "b/T4/MSemyonov/\321\200\320\265\320\267\321\203\320\273\321\214\321\202\320\260\321\202.docx"
new file mode 100644
index 0000000..d6f409e
Binary files /dev/null and "b/T4/MSemyonov/\321\200\320\265\320\267\321\203\320\273\321\214\321\202\320\260\321\202.docx" differ
diff --git "a/T5/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt" "b/T5/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
new file mode 100644
index 0000000..2d9fbd3
--- /dev/null
+++ "b/T5/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
@@ -0,0 +1,43 @@
+#include<iostream>
+#include<vector>
+#include<chrono>
+
+int main() {
+	int n;
+	std::cin >> n;
+	auto start = std::chrono::high_resolution_clock::now();
+	std::vector <std::vector<int>> a;
+	a.resize(n, std::vector<int> (0));
+	int* b = new int[n];
+	for (int i = 0; i < n; i++) {
+		b[i] = rand() % 100;
+	}
+	for (int i = 0; i < n; i++) {
+		a[b[i] % 10].push_back(b[i]);
+	}
+	int k = 0;
+	for (int i = 0; i < n; i++) {
+		for (int j = 0, size = a[i].size(); j < size; j++) {
+			b[k] = a[i][j];
+			k++;
+		}
+	}
+	a.clear();
+	a.resize(n, std::vector<int>(0));
+		for (int i = 0; i < n; i++) {
+			a[b[i] / 10].push_back(b[i]);
+		}
+		k = 0;
+		for (int i = 0; i < n; i++) {
+			for (int j = 0, size = a[i].size(); j < size; j++){
+				b[k] = a[i][j];
+				k++;
+			}
+		}
+
+		auto finish = std::chrono::high_resolution_clock::now();
+		std::chrono::duration<double> elapsed = finish - start;
+		std::cout << elapsed.count();
+	std::cin >> n;
+	return 0;
+}
\ No newline at end of file
diff --git "a/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt" "b/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
new file mode 100644
index 0000000..f7f678f
--- /dev/null
+++ "b/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1C).txt"
@@ -0,0 +1,32 @@
+#include<stdio.h>
+#include<stack>
+
+using namespace std;
+
+int main()
+{
+    int d;
+    printf("vvedi desyatichnoe chislo: ");
+    scanf("%d", &d);
+    if(!d)
+    {
+        printf("dvoichnoe chislo: 0\n");
+        return 0;
+    }
+
+    stack<char> s;
+    while(d)
+    {
+        s.push('0' + (d % 2));
+        d /= 2;
+    }
+
+    printf("dvoichnoe: ");
+    while(!s.empty())
+    {
+        printf("%c", s.top());
+        s.pop();
+    }
+    printf("\n");
+    return 0;
+}
\ No newline at end of file
diff --git "a/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt" "b/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
new file mode 100644
index 0000000..7b4847a
--- /dev/null
+++ "b/T6/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\265(1P).txt"
@@ -0,0 +1,34 @@
+import sys
+
+this = []
+
+def isEmpty():
+    global this
+    return this == []
+
+def push(item):
+    global this
+    this.append(item)
+
+def pop():
+    global this
+    return this.pop()
+
+def size():
+    global this
+    return len(this)
+
+
+print "Input digit: "
+d = int(input())
+if d == 0:
+    print "Binary digit is: 0"
+else:
+    while d:
+        push(d % 2)
+        d /= 2
+
+    print "Binary digit is: "
+    while isEmpty() == False:
+        sys.stdout.write(str(pop()))
+    sys.stdout.write("\n")
\ No newline at end of file
diff --git "a/T7/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt" "b/T7/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt"
new file mode 100644
index 0000000..0445190
--- /dev/null
+++ "b/T7/MSemyonov/\320\267\320\260\320\264\320\260\320\275\320\270\320\2651.txt"
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stdio.h>
+#include <stdlib.h>
+
+using namespace std;
+
+int main(void)
+{
+	int i,x;
+	queue<int>q1;
+	queue<int>q2;
+    	vector<int>numb={1,2,3,4,5,6,7,8,9,10};
+	for(i=1; i<=10; i++){
+		if(numb[i]%2==0){
+			q1.push(i);
+		}
+		else{
+			q2.push(i);
+		}
+	}
+	cout<<"perviy element s chetnimi ciframi:  ";
+	cout<<q2.front()<<"\n";
+	cout<<"posledniy element s chetnimi ciframi:";
+	cout<<q2.back()<<"\n\n";
+	cout<<"perviy element s nechetnimi ciframi:  ";
+	cout<<q1.front()<<"\n";
+	cout<<"posledniy element s nechetnimi ciframi: ";
+	cout<<q1.back()<<"\n";
+	return 0;
+}
\ No newline at end of file