commit 173e6c3cff5305f55c3760cc424fb5f63a22fc1b
Author: MachulinaDV <MachulinaDV@mpei.ru>
Date:   Mon Apr 10 14:32:18 2023 +0300

    build: исходные файлы

diff --git a/1M.cbp b/1M.cbp
new file mode 100644
index 0000000..2a6af57
--- /dev/null
+++ b/1M.cbp
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_project_file>
+	<FileVersion major="1" minor="6" />
+	<Project>
+		<Option title="1M" />
+		<Option pch_mode="2" />
+		<Option compiler="gcc" />
+		<Build>
+			<Target title="Debug">
+				<Option output="bin/Debug/1M" 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/1M" 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" />
+			<Add option="-fexceptions" />
+		</Compiler>
+		<Unit filename="main.cpp" />
+		<Extensions>
+			<lib_finder disable_auto="1" />
+		</Extensions>
+	</Project>
+</CodeBlocks_project_file>
diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..f2ac5b1
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,84 @@
+#include <iostream>
+#include <vector>
+#include <math.h>
+
+
+using namespace std;
+
+int main()
+{
+    size_t n, bin, height;
+    string str = "*";
+    double max, min, step, a;
+    int i, j;
+
+    cerr<<"Marks: ";
+    cin>>n;
+
+    vector<double>A(n);
+
+
+    for (i=0; i<n; i++)
+    {
+        cerr<<"A["<<i<<"]=";
+        cin>>A[i];
+    }
+
+    cerr<<"Rows: ";
+    cin>>bin;
+
+    vector<size_t>B(bin);
+
+    max = 0;
+    min = 10;
+
+    for (i=0; i<n; i++)
+    {
+        if (A[i]>max)
+            max = A[i];
+        if (A[i]<min)
+            min = A[i];
+    }
+
+    step = (max-min)/bin;
+
+    for (i=0; i<n; i++)
+    {
+        for (j=0; j<bin; j++)
+        {
+            if ((A[i]>=(min+j*step))&&(A[i]<(min+(j+1)*step)))
+            {
+                B[j]++;
+                break;
+            }
+        }
+    }
+
+     for (i=0; i<n; i++)
+    {
+       if (A[i]== max)
+        B[bin-1]++;
+    }
+
+    for (i=0; i<bin; i++)
+    {
+        if (B[i]<10)
+        {
+            cout<<"  ";
+        }
+        else if (B[i]<100)
+        {
+            cout<<" ";
+        }
+        cout<<B[i]<<"|";
+        for (j=0; j<B[i]; j++)
+        {
+            cout<<"*";
+        }
+        cout<<endl;
+    }
+
+
+
+    return 0;
+}