Сравнить коммиты
2 Коммитов
a80c85ec3d
...
ebd84a6053
| Автор | SHA1 | Дата | |
|---|---|---|---|
| ebd84a6053 | |||
| 7f6eb5a910 |
61
main.cpp
61
main.cpp
@@ -6,26 +6,33 @@ const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main()
|
||||
{
|
||||
size_t number_count, bin_count, max_count;
|
||||
|
||||
cerr << "Enter number count: ";
|
||||
struct Input {
|
||||
vector<double> numbers;
|
||||
size_t bin_count{};
|
||||
size_t number_count{};
|
||||
};
|
||||
|
||||
|
||||
Input
|
||||
input_data() {
|
||||
size_t number_count;
|
||||
cin >> number_count;
|
||||
|
||||
Input in;
|
||||
in.numbers.resize(number_count);
|
||||
vector<double> numbers(number_count);
|
||||
|
||||
cerr << "Enter numbers: ";
|
||||
for (size_t i = 0; i < number_count; i++) {
|
||||
cin >> numbers[i];
|
||||
cin >> in.numbers[i];
|
||||
}
|
||||
|
||||
cerr << "Enter bin count: ";
|
||||
cin >> bin_count;
|
||||
|
||||
double min = numbers[0];
|
||||
double max = numbers[0];
|
||||
size_t bin_count;
|
||||
cin >> in.bin_count;
|
||||
return in;
|
||||
}
|
||||
|
||||
void
|
||||
find_minmax(const vector<double>& numbers, double& min, double& max) {
|
||||
min = numbers[0];
|
||||
for (double x : numbers) {
|
||||
if (x < min) {
|
||||
min = x;
|
||||
@@ -34,13 +41,15 @@ int main()
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
vector<size_t> make_histogram(const vector<double> numbers, size_t bin_count){
|
||||
vector<size_t> bins(bin_count);
|
||||
vector<size_t> procent(bin_count);
|
||||
|
||||
double max, min = 0;
|
||||
find_minmax(numbers, min, max);
|
||||
double bin_size = (max - min) / bin_count;
|
||||
|
||||
for (size_t i = 0; i < number_count; i++) {
|
||||
for (size_t i = 0; i < numbers.size(); i++) {
|
||||
bool found = false;
|
||||
for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
|
||||
auto lo = min + j * bin_size;
|
||||
@@ -52,8 +61,14 @@ int main()
|
||||
}
|
||||
if (!found) {
|
||||
bins[bin_count - 1]++;
|
||||
|
||||
}
|
||||
}
|
||||
return bins;
|
||||
}
|
||||
|
||||
vector<size_t> make_histogram_proc(const vector<double> numbers, size_t bin_count, vector<size_t> bins){
|
||||
vector<size_t> procent(bin_count);
|
||||
double sum = 0;
|
||||
for (size_t i = 0; i < bin_count; i++){
|
||||
sum = sum + bins[i];
|
||||
@@ -64,9 +79,12 @@ int main()
|
||||
ost = ost - procent[i];
|
||||
}
|
||||
procent[bin_count-1]=ost;
|
||||
return procent;
|
||||
}
|
||||
|
||||
void show_histogram_text(vector<size_t> bins, size_t bin_count, vector<size_t> procent){
|
||||
|
||||
max_count = 0;
|
||||
size_t max_count = 0;
|
||||
for (size_t x: bins) {
|
||||
if (x > max_count) {
|
||||
max_count = x;
|
||||
@@ -113,5 +131,14 @@ int main()
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
auto in = input_data();
|
||||
auto bins = make_histogram(in.numbers, in.bin_count);
|
||||
auto procent = make_histogram_proc(in.numbers, in.bin_count, bins);
|
||||
show_histogram_text(bins, in.bin_count, procent);
|
||||
return 0;
|
||||
}
|
||||
|
||||
Ссылка в новой задаче
Block a user