Сравнить коммиты

..

5 Коммитов

Автор SHA1 Сообщение Дата
victoriaCS
85277aaf0c code: добавление prompt 2025-09-17 22:22:49 +03:00
victoriaCS
689ac0417f code: изменение input_data() 2025-09-17 22:15:28 +03:00
victoriaCS
da84686c71 code: разделение программы на файлы 2025-05-04 20:47:04 +03:00
victoriaCS
1a7558d214 code: добавление файла doctest.h 2025-04-30 23:39:28 +03:00
victoriaCS
056cafb485 code: внесение правок в код 2025-04-30 21:37:44 +03:00

101
main.cpp
Просмотреть файл

@@ -1,85 +1,40 @@
#include <iostream> #include <iostream>
#include <vector> #include <vector>
#include "svg.h"
#include "hictogram.h"
using namespace std; using namespace std;
int main() struct Input {
{ vector<double> numbers;
const size_t SCREEN_WIDTH = 80; size_t bin_count{};
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; };
Input input_data(istream& in, bool prompt) {
size_t number_count; size_t number_count;
cerr << "Enter number count: "; if (prompt){
cin >> number_count; cerr << "Enter number count: "
vector<double> numbers(number_count); }
for (size_t i=0;i<number_count;i++){ in >> number_count;
cin >> numbers[i];
Input in_data;
in_data.numbers.resize(number_count);
for (size_t i = 0; i < number_count; i++) {
in >> in_data.numbers[i];
} }
if (prompt){
size_t bin_count; cer << "Enter bin count: "
cerr << "Enter bin count: ";
cin >> bin_count;
vector<size_t> bins(bin_count, 0);
double min = numbers[0];
double max = numbers[0];
for (double x: numbers) {
if (x<min) {
min = x;
}
else if (x > max) {
max = x;
}
} }
in >> in_data.bin_count;
double bin_size = (max - min) / bin_count; return in_data;
}
for(size_t i = 0; i<number_count; i++){
bool found = false; int main() {
for(size_t j=0; (j<bin_count-1) && !found; j++){ auto in = input_data(cin, true);
auto lo = min + j*bin_size; auto bins = make_histogram(in.numbers, in.bin_count);
auto hi = min+(j+1)*bin_size; show_histogram_svg(bins);
if((lo<= numbers[i]) && (numbers[i] < hi)){
bins[j]++;
found = true;
}
}
if(!found){
bins[bin_count - 1 ]++;
}
}
size_t max_count = bins[0];
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++) {
if (bins[i] < 10) {
cout << " " << bins[i] << "|";
}
else if (bins[i] < 100) {
cout << " " << bins[i] << "|";
}
else if (bins[i] < 1000) {
cout << bins[i] << "|";
}
size_t height;
if (max_count <= MAX_ASTERISK){
height = bins[i];
}
else {
height = MAX_ASTERISK*(static_cast<double>(bins[i])/max_count);
}
for (size_t j=0; j<height;j++){
cout << "*";
}
cout << endl;
}
return 0;
} }