первый коммит

.gitignore

@@ -0,0 +1,4 @@
+/bin
+/obj
+*.layout
+*.depend

TWOPO.cbp

@@ -0,0 +1,36 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_project_file>
+	<FileVersion major="1" minor="6" />
+	<Project>
+		<Option title="TWOPO" />
+		<Option pch_mode="2" />
+		<Option compiler="gcc" />
+		<Build>
+			<Target title="Debug">
+				<Option output="bin/Debug/TWOPO" prefix_auto="1" extension_auto="1" />
+				<Option object_output="obj/Debug/" />
+				<Option type="1" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-g" />
+				</Compiler>
+			</Target>
+			<Target title="Release">
+				<Option output="bin/Release/TWOPO" prefix_auto="1" extension_auto="1" />
+				<Option object_output="obj/Release/" />
+				<Option type="1" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-O2" />
+				</Compiler>
+				<Linker>
+					<Add option="-s" />
+				</Linker>
+			</Target>
+		</Build>
+		<Compiler>
+			<Add option="-Wall" />
+		</Compiler>
+		<Extensions />
+	</Project>
+</CodeBlocks_project_file>

TWOPO.cpp

@@ -0,0 +1,90 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main()
+{
+    setlocale(LC_ALL, "Russian");
+    size_t number_count; size_t bin_count;size_t max_count;
+
+    cerr << "Ââåäèòå êîëè÷åñòâî îöåíîê: ";
+    cin >> number_count;
+
+    vector<double> numbers(number_count);
+    vector<size_t> bins(bin_count);
+
+
+    for(size_t i = 0; i < number_count; i++){
+        cerr << "Ââåäèòå ÷èñëî " << i + 1 << " : ";
+        cin >> numbers[i];
+    }
+    cerr << "Ââåäèòå êîëè÷åñòâî êîðçèí: ";
+    cin >> bin_count;
+    //íàõîæäåíìå èíòåðâàëîâ êîðçèí(min è max)
+    double min = numbers[0];
+    double max = numbers[0];
+    for (double x : numbers) {
+    if (x < min) {
+        min = x;
+    }
+    else if (x > max) {
+        max = x;
+    }
+    }
+    double bin_size = (max - min) / bin_count;
+    //
+    //
+    for (size_t i = 0; i < number_count; i++) {
+    bool found = false;
+    for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
+        auto lo = min + j * bin_size;
+        auto hi = min + (j + 1) * bin_size;
+        if ((lo <= numbers[i]) && (numbers[i] < hi)) {
+            bins[j]++;
+            found = true;
+        }
+    }
+        if (!found) {
+        bins[bin_count - 1]++;
+    }
+    }
+    //maxcount
+    for(size_t i = 0; i < bin_count; i++){
+        if (bins[i] > max_count){
+            max_count = bins[i];
+        }
+    }
+
+    //âûâîä
+    //
+    for(size_t i = 0; i < bin_count; i++){
+
+        size_t count = 0;
+        //cout << min + i*bin_size<< "|";
+        size_t num = bins[i];
+        while(num != 0){
+            num/=10;
+            count++;}
+        size_t z = (3 - count);
+        while(z > 0){
+            cout << " ";
+            z--;
+        }
+
+        cout << bins[i] << "|";
+        if(max_count > 76){
+            size_t height = 76 * (static_cast<double>(bins[i] / max_count));
+            for(size_t j = 0; j < height; j++) {
+            cout << "*";
+            }
+            cout << endl;
+        }
+        else{
+        for(size_t j = 0; j < (bins[i]); j++) {
+            cout << "*";
+        }
+        cout << endl;
+        }
+    }
+}