Пункт 1-3
Этот коммит содержится в:
58
main.cpp
58
main.cpp
@@ -2,25 +2,30 @@
|
|||||||
#include <vector>
|
#include <vector>
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
int main(){
|
struct Input {
|
||||||
|
vector<double> numbers;
|
||||||
|
size_t bin_count{};
|
||||||
|
};
|
||||||
|
|
||||||
const size_t SCREEN_WIDTH = 80;
|
Input
|
||||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 6 - 1;
|
input_data(){
|
||||||
size_t bin_count, counts;
|
Input in;
|
||||||
cerr << "Enter counts:";
|
size_t number_count;
|
||||||
cin >> counts;
|
cin >> number_count;
|
||||||
|
in.numbers.resize(number_count);
|
||||||
|
|
||||||
vector <double> numbers(counts);
|
vector<double> numbers(number_count);
|
||||||
|
for (size_t i = 0; i < number_count; i++) {
|
||||||
for (size_t i = 0; i < counts; i++){
|
cin >> in.numbers[i];
|
||||||
cerr << "Enter array "<< i <<" number:";
|
|
||||||
cin >> numbers[i];
|
|
||||||
}
|
}
|
||||||
|
|
||||||
cerr << "Enter bin_count:";
|
cin >> in.bin_count;
|
||||||
cin >> bin_count;
|
return in;
|
||||||
|
}
|
||||||
|
|
||||||
double minN = numbers[0], maxN = numbers[0];
|
void find_minmax( const vector<double>& numbers, double& minN, double& maxN) {
|
||||||
|
minN = numbers[0];
|
||||||
|
maxN = numbers[0];
|
||||||
|
|
||||||
for (double x: numbers){
|
for (double x: numbers){
|
||||||
if (minN > x){
|
if (minN > x){
|
||||||
@@ -31,12 +36,16 @@ int main(){
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
double diff = (maxN - minN) / bin_count;
|
}
|
||||||
|
|
||||||
|
auto make_histogram(vector<double> numbers, size_t bin_count){
|
||||||
|
double minN, maxN;
|
||||||
|
find_minmax( numbers, minN, maxN);
|
||||||
|
|
||||||
vector <size_t> bins(bin_count);
|
vector <size_t> bins(bin_count);
|
||||||
|
double diff = (maxN - minN) / bin_count;
|
||||||
size_t max_count = 0;
|
size_t max_count = 0;
|
||||||
for (size_t i = 0; i < counts; i++){
|
for (size_t i = 0; i <numbers.size() ; 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 = minN + j * diff;
|
auto lo = minN + j * diff;
|
||||||
@@ -55,7 +64,13 @@ int main(){
|
|||||||
max_count = bins[bin_count - 1];
|
max_count = bins[bin_count - 1];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
return bins;
|
||||||
|
}
|
||||||
|
|
||||||
|
void show_histogram_text(vector <size_t> bins,size_t bin_count, size_t max_count){
|
||||||
|
const size_t SCREEN_WIDTH = 80;
|
||||||
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 6 - 1;
|
||||||
|
|
||||||
bool scaling = false;
|
bool scaling = false;
|
||||||
|
|
||||||
@@ -90,3 +105,10 @@ int main(){
|
|||||||
cout << endl;
|
cout << endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
int main(){
|
||||||
|
size_t max_count;
|
||||||
|
auto in = input_data();
|
||||||
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
||||||
|
show_histogram_text(bins,in.bin_count, max_count);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|||||||
Ссылка в новой задаче
Block a user