разбиение программы на функции все файлы

1234

@@ -0,0 +1,39 @@
+-----BEGIN OPENSSH PRIVATE KEY-----
+b3BlbnNzaC1rZXktdjEAAAAACmFlczI1Ni1jdHIAAAAGYmNyeXB0AAAAGAAAABBggUxYc3
+C53Yi+Vb55hoWJAAAAEAAAAAEAAAGXAAAAB3NzaC1yc2EAAAADAQABAAABgQDc7hR2g019
+2U8+FPM6wAy+wvLnJR/ihgwjoU+LUuG1gLCO3hUYTIorzWwUUsIL2vRmdVlDH4DJkdM4IQ
+vLJo2MVSS89bex7n957s6YDSOT9eGxDAgOOEEE9v7fUCFQRSBSCzh7UQ3s8olH+X4oHQv8
+9AeOtY4mRjcyBs7Z3xBQ4nTQEEXtNAVSdOwNtKq6dxyHjA2ecb4RmTFr1Kfm0BCl4yovQB
+OL64JKWVHtX2RyUX/FBSPg8wuI6Z+oaM7w/97zzxg+h4YJMv0VfgQx3PYoz3eOYd7WYwMV
+sqsRpJiRCnEmYfItdea7ORp1PBJjeilqFeEy34E/zuhFt1Tdo0OtIjbsiYGs8W6mdRYZS5
+T5S5v9/RdqWaCu7BiLMjylELYv4GT0JcZIJllrIMKhxKdp4ZdsC41lQS5FBZJBh2QZUfnd
+6Ca5DTJFOW5Dcbe8wxjbh7CrDgFbidZunU6tBz/oTptzJxlZ6WnZnRfHk7dPGy9aRFlpU8
+mRZ1v5C1462gMAAAWQcm6J5wTGQddqIBClPYebglF3DOR8/S/hvV72n1Bz7BZFl2t4SzYl
+0oV8wV6YnSa8q78ceMf3X0ZKr3Omx3h6Qt1wkZ9NTnrS7LHdTLiTwdBc5FpxpI49LbX0kc
+t2cTgj5xXmrBkHG5FPrUyAVrZgYhJj5dVgKA1oEPSnG0J16N8oD36kCyJGPWmsw0lHBCQm
+9Qs13vxC5hJ+HW43ZkNXa/3Eq4gBR8KaMoER3Ey7SRErW9DQO9Um8TBaD55FzqEydexnoi
+UgcrC2mZO3Eh5d4v+mdmKqUnCYewuiFkYt8SA7GUlYnJCZCDvAAgs+s0+oZt8pXCuDFcXf
+JnmGiCiUc2vActSrGEJSeTY9yxociMwb0ojZU0hjmd+L0POGb3nJ3mCOfwTD6aVtCRH7Cn
+fsTvILIjttHBB48LAWw5ST+6oIMl2zG5n33MbQU4cKup0idGOFayD0nC2BkxODXqGXfCa5
+4bDH7vqcCBhb9KYJQ8pk/Up1sVmn0rAGr+gtIa/UJhLK2pbP0D5jU1D92AJUpeJ6Y60Mc3
+jL4cV+WFoYzNF4R7aljtL39lYEXoD7o+O+htaJ1ms1ufcAM/kBQieHjWqm3lYpK2SzMc8A
+wCrHOGci7OOkVDENEFCQL/3/RhVngIOFrn2ugAMJMW7tNZDO6v40ltIixX5yK7gZgCi3A/
+KGl8lhqAud6L8j+lYXouWEufSm47ViCW+jy+zIqyKP0uF1gtZUAXDkiFR04IqsVZv+dZdI
+IWwQPY5qiLuM36DGSnylFtlBTyYaj0+hRWtfAJ0TGEipAubCty8BB3y7UfkpLYMg2F9agY
+lt/zVlIgCuToe5nIsxBh/AjJfLwxKUmpITHWnTqp1Q9Zel4aZMOUUe4UMApSlemHkG78D3
+lQvWzk426oLPbod01PDwwdORFtoCBurTucketZ6++XOXmPzOOARvyDxX/CtBHBSYsgcMXE
+5KvRGfTA4+0JDMDSzMNqouI2E50ybdZHg3TVqA/vGHsgbaK7ffhNf3eMDD571ZH9y5ClO9
+LzLPnIc1VJjqcN3srlp5tOv/29KbV/6LrfRcEAX3JqXFvQFWDMAK5Wj7B4Cnflfmji0W6/
+bMNpUotFJOnqNoWJquKiN94JPj188PIwJewfHqeHL4sF2ytO1mbQZa+X9ILupTxpMT2gZJ
+FUVUN8JCyfrruLeu4mOwlsTICYSqmeoOHxyAoZO9fces73K7/iKMncNcfPmLpn6Rdjwz3j
+JNFhGVFAg6X/d9TF9lEWcevHAMVRd588fAVFaT69x3eNUl7ZMi+43XmTHffYMh+yqpXVBu
+5MfColuYjN7j5vmrfApQvoLOdWGtGg3rderqVZ3tHYaBGfgwqKrv8OD8rIcZtOT1+Tdv7x
+nIRBpL7gZmFixWiO0xiajE29WsPBnfrZWzcDTcjRg3bo1fU7XtAVS7UZwMpu1SyG/z8xZJ
++ph0XDk7gIiDne2LP03INZZvg0IFSmSON08ms5rMYHyebIY42/3p5foFlTC0CGfxK8riaM
+b3Btu7DC2ZFpZ2QMDpof14nZyfBbDG4MpR2bvi2bxbTgqS+hK+tskDl1HKFd/G3eDx40hp
+RGqzidjXmJORvXD/Ihgz8zBTtp27lfSb1PnDhz352hOWvpyYJpdsh8m1c1A96cfI5eErxs
+QA39NgQK8eJL3Q4gFC2vS8aT4sZ8ZjW5DJeBjSUsuTeZtwzKWOHCGu6fb3JLmaZemqZmrX
+qzkQ6D/SE+/rLIs5CnycTn5qPemVLjuqOIVS7PyLJfDMM2mo+2gt5UNnJ7ed8+/9mE+8ym
+PwT2p6UFf9OlZsNZS4LHopEXVEzLwq7OKVPBmS3yKhzTlWZKiyx7BrlqUEFI55384v2Vc+
+s/5quc104QwY52nHlZsypy9k76Y=
+-----END OPENSSH PRIVATE KEY-----

1234.pub

@@ -0,0 +1 @@
+ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABgQDc7hR2g0192U8+FPM6wAy+wvLnJR/ihgwjoU+LUuG1gLCO3hUYTIorzWwUUsIL2vRmdVlDH4DJkdM4IQvLJo2MVSS89bex7n957s6YDSOT9eGxDAgOOEEE9v7fUCFQRSBSCzh7UQ3s8olH+X4oHQv89AeOtY4mRjcyBs7Z3xBQ4nTQEEXtNAVSdOwNtKq6dxyHjA2ecb4RmTFr1Kfm0BCl4yovQBOL64JKWVHtX2RyUX/FBSPg8wuI6Z+oaM7w/97zzxg+h4YJMv0VfgQx3PYoz3eOYd7WYwMVsqsRpJiRCnEmYfItdea7ORp1PBJjeilqFeEy34E/zuhFt1Tdo0OtIjbsiYGs8W6mdRYZS5T5S5v9/RdqWaCu7BiLMjylELYv4GT0JcZIJllrIMKhxKdp4ZdsC41lQS5FBZJBh2QZUfnd6Ca5DTJFOW5Dcbe8wxjbh7CrDgFbidZunU6tBz/oTptzJxlZ6WnZnRfHk7dPGy9aRFlpU8mRZ1v5C1462gM= nn110@LAPTOP-P049CSND

histogram.cpp

@@ -0,0 +1,60 @@
+#include "histogram.h"
+#include <vector> 
+using namespace std;
+void find_minmax(const vector<double>& numbers, double& min, double& max) {
+    min = numbers[0];
+    for (auto i = 0; i < numbers.size(); i++) {
+        if (numbers[i] < min) {
+            min = numbers[i];
+        }
+    }
+
+    max = numbers[0];
+    for (auto i = 0; i < numbers.size(); i++) {
+        if (numbers[i] > max) {
+            max = numbers[i];
+        }
+    }
+
+}
+vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
+
+    vector<size_t> bins(bin_count);
+    vector<size_t> binss(bin_count);
+
+    double max, min;
+    find_minmax(numbers, min, max);
+    double bin_size = (max / min) / bin_count;
+
+    for (size_t i = 0; i < numbers.size(); 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]++;
+        }
+    }
+
+    int max_count = bins[0];
+    for (size_t i = 0; i < bin_count; i++) {
+        if (bins[i] > max_count) {
+            max_count = bins[i];
+        }
+    }
+
+    if (max_count > 76) {
+
+        for (size_t i = 0; i < bin_count; i++) {
+            int count = bins[i];
+            size_t height = 76 * (static_cast<double>(count) / max_count);
+            bins[i] = height;
+        }
+    }
+    return bins;
+}

histogram.h

@@ -0,0 +1,4 @@
+#include <vector>
+
+std::vector<size_t>
+make_histogram(const std::vector<double>& numbers, size_t bin_count);

text.cpp

@@ -0,0 +1,20 @@
+#include "text.h"
+#include <vector> 
+#include <iostream>
+using namespace std;
+void show_histogram_text(vector <size_t> bins, size_t bin_count) {
+
+    for (size_t i = 0; i < bin_count; i++) {
+        if (bins[i] < 100) {
+            cout << " ";
+        }
+        if (bins[i] < 10) {
+            cout << " ";
+        }
+        cout << bins[i] << "|";
+        for (size_t j = 0; j < bins[i]; j++) {
+            cout << "*";
+        }
+        cout << "\n";
+    }
+}

text.h

@@ -0,0 +1,3 @@
+#include <vector> 
+std::vector<size_t>
+show_histogram_text(std::vector <size_t> bins, size_t bin_count);