code: пункты 1-4 + gitignore

Этот коммит содержится в:
2023-04-23 19:11:38 +03:00
родитель 364387aa08
Коммит ec0a932aa9
2 изменённых файлов: 89 добавлений и 81 удалений

1
.gitignore поставляемый Обычный файл
Просмотреть файл

@@ -0,0 +1 @@
.vscode

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

@@ -1,103 +1,110 @@
#include <iostream> #include <iostream>
#include <cmath>
#include <vector> #include <vector>
using namespace std;
int main()
{
size_t count, bin_count;
size_t i, j; using namespace std;
float min, max, bin_size; const size_t SCREEN_WIDTH = 80;
float low, hi; const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
cerr << "Count= ";
cin >> count; struct Input {
cerr << "Bin_count= "; vector<double> numbers;
cin >> bin_count; size_t bin_count{};
vector<double>numbers(count); };
vector<size_t>bins(bin_count);
for (i = 0; i < count; i++) Input
input_data(){
size_t number_count;
cerr << "Enter number count: ";
cin >> number_count;
Input in;
in.numbers.resize(number_count);
for(int i;i<number_count;i++)
{ {
cin >> numbers[i]; cin >> in.numbers[i];
} }
cerr << "Enter bin count: ";
cin >> in.bin_count;
return in;
}
void
find_minmax(vector<double> numbers, double& min, double& max) {
min = numbers[0]; min = numbers[0];
max = numbers[0]; max = numbers[0];
for (i = 0; i < count; i++) for (double x : numbers) {
{ if (x < min) {
if (numbers[i] > max) min = x;
max = numbers[i];
if (numbers[i] < min)
min = numbers[i];
} }
bin_size = (max - min) / bin_count; else if (x > max) {
low = min; max = x;
hi = low + bin_size; }
for ( i = 0; i < count; i++) }
{ }
bool found = false;
for (j = 0; (j < bin_count -1) && !found; j++) vector<size_t>
{ make_histogram(vector<double> numbers, size_t bin_count) {
low = min + j * bin_size; vector <size_t> bins(bin_count);
hi = min + (j + 1) * bin_size; double min, max;
if ((low <= numbers[i]) && (numbers[i] < hi)) find_minmax(numbers, min, max);
{ size_t countt;
bins[j]++; double bin_size = (max - min) / bin_count;
found = true; for (size_t i = 0; i < numbers.size(); i++) {
} bool found = false;
} for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
if (found==false) auto lo = min + j * bin_size;
{ auto hi = min + (j + 1) * bin_size;
bins[bin_count - 1]++; if ((lo <= numbers[i]) && (numbers[i] < hi)) {
bins[j]++;
found = true;
} }
} }
if (!found) {
bins[bin_count - 1]++;
size_t sum_bins=0;
for (size_t bin:bins)
{
sum_bins+=bin;
} }
size_t sred_bin = sum_bins/bin_count; }
return bins;
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
size_t max_bin=bins[0]; }
for (size_t bin:bins)
if (bin>max_bin) void
max_bin=bin; show_histogram_text(auto bins, size_t bin_count){
for (size_t bin:bins) size_t max_count = 0;
{ for (size_t i = 0; i < bin_count; i++){
int height = bin; if(bins[i]>max_count)
if (max_bin > MAX_ASTERISK) max_count = bins[i];
{
height = MAX_ASTERISK * (static_cast<double>(bin) / max_bin);
} }
if (bin < 100) size_t height;
for (size_t i = 0; i < bin_count; i++)
{
if (bins[i] < 100)
cout << " "; cout << " ";
if (bin < 10) if (bins[i] < 10)
cout << " "; cout << " ";
cout<<bin<<"|"; cout<<bins[i]<<"|";
if (height>sred_bin){ if(max_count>MAX_ASTERISK){
for(size_t i=0; i<sred_bin; i++) for (size_t j = 0; j <(height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count)) ; j++)
cout<<"*"; {
for(size_t i=sred_bin; i<height; i++) cout<<"*";
cout<<"+"; }
} cout<<endl;
else{ }
for (size_t i=0; i<height; i++) else
cout<<"*"; {
for (size_t i=height; i<sred_bin; i++) for (size_t j = 0; j <bins[i] ; j++)
cout<<"-"; {
cout<<"*";
} }
cout<<endl;
cout<<endl; }
} }
}
int main()
{ Input in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
return 0; return 0;
} }