|
|
@ -1,71 +1,29 @@
|
|
|
|
#include <iostream>
|
|
|
|
#include <iostream>
|
|
|
|
#include <vector>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
#include "histogram.h"
|
|
|
|
using namespace std;
|
|
|
|
using namespace std;
|
|
|
|
int main(){
|
|
|
|
|
|
|
|
double min,max,lo,hi;
|
|
|
|
struct Input {
|
|
|
|
size_t number_count,bin_count,i,j;
|
|
|
|
vector<double> numbers;
|
|
|
|
const size_t SCREEN_WIDTH = 80;
|
|
|
|
size_t bin_count{};
|
|
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 4;
|
|
|
|
};
|
|
|
|
cerr<<"Enter number_count: ";
|
|
|
|
|
|
|
|
cin>>number_count;
|
|
|
|
Input
|
|
|
|
cerr<<"Enter numbers: ";
|
|
|
|
input_data(istream& in){
|
|
|
|
vector<double> numbers;
|
|
|
|
size_t number_count;
|
|
|
|
for(size_t i=0;i<number_count;++i){
|
|
|
|
in >> number_count;
|
|
|
|
double num;
|
|
|
|
Input cin;
|
|
|
|
cin>>num;
|
|
|
|
cin.numbers.resize(number_count);
|
|
|
|
numbers.push_back(num);
|
|
|
|
for (size_t i = 0; i < number_count; i++){
|
|
|
|
}
|
|
|
|
in >> cin.numbers[i];}
|
|
|
|
cerr<<"Enter bin_count: ";
|
|
|
|
in >> cin.bin_count;
|
|
|
|
cin>>bin_count;
|
|
|
|
return cin;
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
|
|
|
|
min=numbers[0];
|
|
|
|
|
|
|
|
max=numbers[0];
|
|
|
|
|
|
|
|
for(i=0;i<number_count;i++){
|
|
|
|
|
|
|
|
if (numbers[i]<min){
|
|
|
|
|
|
|
|
min=numbers[i];
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
else if (numbers[i]>max){
|
|
|
|
|
|
|
|
max=numbers[i];
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
double bin_size=(max-min)/bin_count;
|
|
|
|
|
|
|
|
for (size_t i=0;i<number_count;i++){
|
|
|
|
int main(){
|
|
|
|
bool found = false;
|
|
|
|
auto in = input_data(cin);
|
|
|
|
for (size_t j=0;(j<bin_count - 1) && !found; j++){
|
|
|
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
|
|
|
lo = min + j*bin_size;
|
|
|
|
show_histogram(bins, in.bin_count);
|
|
|
|
hi = min + (j+1)*bin_size;
|
|
|
|
return 0;
|
|
|
|
if ((lo <= numbers[i])&&(numbers[i]<hi)){
|
|
|
|
|
|
|
|
bins[j]++;
|
|
|
|
|
|
|
|
found = true;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!found){
|
|
|
|
|
|
|
|
bins[bin_count - 1]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t max_count = 0;
|
|
|
|
|
|
|
|
for(i=0;i<bin_count;i++){
|
|
|
|
|
|
|
|
if (bins[i]>MAX_ASTERISK){
|
|
|
|
|
|
|
|
max_count=bins[i];
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for(i=0;i<bin_count;i++){
|
|
|
|
|
|
|
|
if(bins[i]<100){
|
|
|
|
|
|
|
|
cout<<" ";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if(bins[i]<10){
|
|
|
|
|
|
|
|
cout<<" ";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
cout<<bins[i]<<"|";
|
|
|
|
|
|
|
|
if(max_count==0){
|
|
|
|
|
|
|
|
for(j=0;j<bins[i];j++){
|
|
|
|
|
|
|
|
cout<<"*";
|
|
|
|
|
|
|
|
}}
|
|
|
|
|
|
|
|
else{
|
|
|
|
|
|
|
|
size_t height = MAX_ASTERISK*(static_cast<double>(bins[i])/max_count);
|
|
|
|
|
|
|
|
for(j=0;j<height;j++){
|
|
|
|
|
|
|
|
cout<<"*";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
cout<<endl;
|
|
|
|
|
|
|
|
}}
|
|
|
|
|
|
|
|