code: исправление ошибки

main
KapitonovMikA 11 месяцев назад
Родитель 84e8b7e56b
Сommit 7b1cfc47e1

@ -1,51 +1,73 @@
#include <iostream> #include <iostream>
#include <conio.h> #include <conio.h>
#include <vector> #include <vector>
#include <stdlib.h>
using namespace std; using namespace std;
int main()
{ struct Input {
const size_t SCREEN_WIDTH = 80; vector<double> numbers;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; size_t bin_count{};
int i, j; };
double num;
size_t number_count, bin_count; Input
cerr << "Enter number count: " << "\n"; input_data(){
size_t number_count;
cerr << "Enter number count: ";
cin >> number_count; cin >> number_count;
vector<double> numbers(number_count);
for (i = 0; i < number_count; i++) Input in;
{
cin >> num; in.numbers.resize(number_count);
numbers[i] = num; cerr << "Enter numbers: " << endl;
} for (size_t i=0; i < number_count; i++)
cerr << "Enter bin count: " << "\n";
cin >> bin_count;
vector<size_t> bins(bin_count);
for (i = 0; i < bin_count; i++)
{ {
bins[i] = 0; cin >> in.numbers[i];
} }
double min_number = numbers[0];
double max_number = numbers[0]; in.bin_count;
for (double x : numbers) cerr << "Enter bin count: ";
{ cin >> in.bin_count;
if (x < min_number) return in;
}
void
find_minmax(vector<double> numbers, double& min, double& max){
min = numbers[0];
max = numbers[0];
for(size_t i=0; i < sizeof(numbers) / sizeof(numbers[0]); i++){
if (numbers[i] < min)
{ {
min_number = x; min = numbers[i];
} }
else if (x > max_number) else if (numbers[i] > max)
{ {
max_number = x; max = numbers[i];
} }
} }
double bin_size = (max_number - min_number) / bin_count; }
for (size_t i = 0; i < number_count; i++)
int main()
{
const size_t MAX_ELEMENT = 76;
Input in = input_data();
double min, max;
find_minmax(in.numbers, min, max);
vector<size_t> bins(in.bin_count);
double bin_size = (max - min) / in.bin_count;
for (size_t i = 0; i < sizeof(in.numbers) / sizeof(in.numbers[0]); i++)
{ {
bool found = false; bool found = false;
for (size_t j = 0; (j < bin_count - 1) && !found; j++) for (size_t j = 0; (j < in.bin_count - 1) && !found; j++)
{ {
auto lo = min_number + j * bin_size; auto lower_Bound = min + j * bin_size;
auto hi = min_number + (j + 1) * bin_size; auto upper_Bound = min + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) if ((lower_Bound <= in.numbers[i]) && (in.numbers[i] < upper_Bound))
{ {
bins[j]++; bins[j]++;
found = true; found = true;
@ -53,43 +75,53 @@ int main()
} }
if (!found) if (!found)
{ {
bins[bin_count - 1]++; bins[in.bin_count - 1]++;
} }
} }
size_t max_bin_capacity = bins[0];
for (size_t x : bins) double max_count = bins[0];
{ for (size_t j=0; j < in.bin_count; j++){
if (x > max_bin_capacity) if (bins[j] > max_count) {
{ max_count = bins[j];
max_bin_capacity = x;
} }
} }
size_t height = 0; vector<size_t> height(in.bin_count);
for (i = 0; i < bin_count; i++) for (size_t j=0; j < in.bin_count; j++){
{ height[j] = MAX_ELEMENT * (bins[j]/max_count);
if (bins[i] < 10) }
{
cout << " " << bins[i] << "|"; if (max_count > MAX_ELEMENT){
} for (size_t j=0; j < in.bin_count; j++)
if ((bins[i] < 100) && (bins[i] > 9)) {
{ if (bins[j] < 100) {
cout << " " << bins[i] << "|"; cout << " ";
} if (bins[j] < 10){
if (bins[i] >= 100) cout << " ";
{ }
cout << bins[i] << "|"; }
} cout << bins[j] << "|";
if (bins[i] > 76){
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_bin_capacity); for (size_t i=0; i < height[j]; i++){
} cout << "*";
if (bins[i] < 76) { }
height = bins[i]; cout << endl;
} }
for (j = 0; j < height; j++) }
{ else {
cout << "*"; for (size_t j=0; j < in.bin_count; j++)
} {
cout << "\n"; if (bins[j] < 100) {
cout << " ";
if (bins[j] < 10){
cout << " ";
}
}
cout << bins[j] << "|";
for (size_t i=0; i < bins[j];i++){
cout << "*";
}
cout << endl;
}
} }
return 0;
} }

Загрузка…
Отмена
Сохранить