code: заготовка программы

laba1.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="laba1" />
+		<Option pch_mode="2" />
+		<Option compiler="gcc" />
+		<Build>
+			<Target title="Debug">
+				<Option output="bin/Debug/laba1" 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/laba1" 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=".gitignore" />
+		<Unit filename="C:/Users/u111-06/Desktop/laba1/.gitignore" />
+		<Unit filename="main.cpp" />
+		<Extensions />
+	</Project>
+</CodeBlocks_project_file>

main.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <conio.h>
+using namespace std;
+
+int main()
+{
+    size_t i,j;
+    size_t numbers_count,bin_count;
+    cout<<"enter number count:";
+    cin>>numbers_count;
+    cout<<"enter bin_count:";
+    cin>>bin_count;
+    vector<double> numbers(numbers_count);
+    for(i=0;i<numbers_count;i++){
+        cout<<"numbers["<<i<<"]=";
+        cin>>numbers[i];
+    }
+    vector<size_t> bins(bin_count);
+    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(i=0;i<numbers_count;i++){
+        bool found=false;
+        for(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]++;
+        }
+    }
+    for(i=0;i<bin_count;i++){
+        cout<<bins[i]<<"|";
+        for(j=0;j<bins[i];j++){
+            cout<<"*";
+        }
+        cout<<endl;
+    }
+    getch();
+}