|
|
@ -1,27 +1,32 @@
|
|
|
|
#include <iostream>
|
|
|
|
#include <iostream>
|
|
|
|
#include <vector>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
|
|
|
|
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;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
size_t number_count, bin_count;
|
|
|
|
Input
|
|
|
|
|
|
|
|
input_data() {
|
|
|
|
|
|
|
|
size_t number_count;
|
|
|
|
cerr << "Enter number count: ";
|
|
|
|
cerr << "Enter number count: ";
|
|
|
|
cin >> number_count;
|
|
|
|
cin >> number_count;
|
|
|
|
vector<double> numbers(number_count);
|
|
|
|
Input in;
|
|
|
|
|
|
|
|
in.numbers.resize(number_count);
|
|
|
|
cerr << "Enter numbers: ";
|
|
|
|
cerr << "Enter numbers: ";
|
|
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
|
|
cin >> numbers[i];
|
|
|
|
cin >> in.numbers[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
cerr << "Enter bin count: ";
|
|
|
|
cerr << "Enter bin count: ";
|
|
|
|
cin >> bin_count;
|
|
|
|
cin >> in.bin_count;
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
return in;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
double min = numbers[0];
|
|
|
|
void
|
|
|
|
double max = numbers[0];
|
|
|
|
find_minmax(const vector<double>& numbers, double& min, double& max) {
|
|
|
|
|
|
|
|
min = numbers[0];
|
|
|
|
|
|
|
|
max = numbers[0];
|
|
|
|
|
|
|
|
|
|
|
|
for (double x : numbers) {
|
|
|
|
for (double x : numbers) {
|
|
|
|
if (x < min) {
|
|
|
|
if (x < min) {
|
|
|
@ -31,6 +36,14 @@ int main()
|
|
|
|
max = x;
|
|
|
|
max = x;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
vector<size_t>
|
|
|
|
|
|
|
|
make_histogram(const vector<double>& numbers, size_t bin_count){
|
|
|
|
|
|
|
|
size_t number_count = numbers.size();
|
|
|
|
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
|
|
|
|
double min, max;
|
|
|
|
|
|
|
|
find_minmax(numbers, min, max);
|
|
|
|
|
|
|
|
|
|
|
|
double bin_size = (max - min) / bin_count;
|
|
|
|
double bin_size = (max - min) / bin_count;
|
|
|
|
|
|
|
|
|
|
|
@ -48,6 +61,15 @@ int main()
|
|
|
|
bins[bin_count - 1]++;
|
|
|
|
bins[bin_count - 1]++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return bins;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
|
|
|
show_histogram_text(const vector<size_t>& bins){
|
|
|
|
|
|
|
|
const size_t SCREEN_WIDTH = 80;
|
|
|
|
|
|
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
auto bin_count = bins.size();
|
|
|
|
|
|
|
|
|
|
|
|
size_t max_count = 0;
|
|
|
|
size_t max_count = 0;
|
|
|
|
for (size_t i = 0; i < bin_count; i++){
|
|
|
|
for (size_t i = 0; i < bin_count; i++){
|
|
|
@ -56,7 +78,6 @@ int main()
|
|
|
|
max_count = Count;
|
|
|
|
max_count = Count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (max_count <= MAX_ASTERISK){
|
|
|
|
if (max_count <= MAX_ASTERISK){
|
|
|
|
for (size_t i = 0; i < bin_count; i++){
|
|
|
|
for (size_t i = 0; i < bin_count; i++){
|
|
|
|
size_t Count = bins[i];
|
|
|
|
size_t Count = bins[i];
|
|
|
@ -90,5 +111,12 @@ int main()
|
|
|
|
cout << "\n";
|
|
|
|
cout << "\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
|
|
|
main() {
|
|
|
|
|
|
|
|
auto in = input_data();
|
|
|
|
|
|
|
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
|
|
|
|
|
|
|
show_histogram_text(bins);
|
|
|
|
}
|
|
|
|
}
|
|
|
|