code: Обновлённый код

main
KapitonovMikA 12 месяцев назад
Родитель aee4e46e52
Сommit 2656f2e097

@ -1,51 +1,51 @@
#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() int main()
{ {
const size_t SCREEN_WIDTH = 80; const size_t MAX_ELEMENT = 76;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; size_t number_count;
int i, j; cerr << "Enter number count: ";
double num;
size_t number_count, bin_count;
cerr << "Enter number count: " << "\n";
cin >> number_count; cin >> number_count;
vector<double> numbers(number_count); vector<double> numbers(number_count);
for (i = 0; i < number_count; i++) cerr << "Enter numbers: " << endl;
for (size_t i=0; i < number_count; i++)
{ {
cin >> num; cin >> numbers[i];
numbers[i] = num;
} }
cerr << "Enter bin count: " << "\n";
size_t bin_count;
cerr << "Enter bin count: ";
cin >> bin_count; cin >> bin_count;
vector<size_t> bins(bin_count);
for (i = 0; i < bin_count; i++) double min = numbers[0];
{ double max = numbers[0];
bins[i] = 0; for(size_t i=0; i < number_count; i++){
} if (numbers[i] < min)
double min_number = numbers[0];
double max_number = numbers[0];
for (double x : numbers)
{
if (x < min_number)
{ {
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;
vector<size_t> bins(bin_count);
double bin_size = (max - min) / bin_count;
for (size_t i = 0; i < number_count; i++) for (size_t i = 0; i < number_count; i++)
{ {
bool found = false; bool found = false;
for (size_t j = 0; (j < bin_count - 1) && !found; j++) for (size_t j = 0; (j < 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 <= numbers[i]) && (numbers[i] < upper_Bound))
{ {
bins[j]++; bins[j]++;
found = true; found = true;
@ -56,40 +56,50 @@ int main()
bins[bin_count - 1]++; bins[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 < 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(bin_count);
for (i = 0; i < bin_count; i++) for (size_t j=0; j < bin_count; j++){
{ height[j] = MAX_ELEMENT * (bins[j]/max_count);
if (bins[i] < 10)
{
cout << " " << bins[i] << "|";
} }
if ((bins[i] < 100) && (bins[i] > 9))
if (max_count > MAX_ELEMENT){
for (size_t j=0; j < bin_count; j++)
{ {
cout << " " << bins[i] << "|"; if (bins[j] < 100) {
cout << " ";
if (bins[j] < 10){
cout << " ";
} }
if (bins[i] >= 100)
{
cout << bins[i] << "|";
} }
if (bins[i] > 76){ cout << bins[j] << "|";
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_bin_capacity);
for (size_t i=0; i < height[j]; i++){
cout << "*";
}
cout << endl;
} }
if (bins[i] < 76) {
height = bins[i];
} }
for (j = 0; j < height; j++) else {
for (size_t j=0; j < bin_count; j++)
{ {
if (bins[j] < 100) {
cout << " ";
if (bins[j] < 10){
cout << " ";
}
}
cout << bins[j] << "|";
for (size_t i=0; i < bins[j];i++){
cout << "*"; cout << "*";
} }
cout << "\n"; cout << endl;
}
} }
return 0;
} }

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