Anastasia 3 недель назад
Родитель 709d781106
Сommit 8a6ff01ca9

@ -1,65 +1,96 @@
#include <vector> #include <iostream>
#include <iostream> #include <vector>
using namespace std; using namespace std;
int main() { struct Input {
const size_t SCREEN_WIDTH = 80; vector<double> numbers;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; size_t bucket{};
int i,j; size_t number_count{};
string a,b,c; };
size_t number_count, bin_count;
cerr << "Enter number count: "; Input
cin >> number_count; input_data() {
cerr << "Enter colichestvo corzin: "; Input in;
cin >> bin_count; cin >> in.number_count;
vector <size_t> bins(bin_count); cin >> in.bucket;
vector <double> numbers(number_count); in.numbers.resize(in.number_count);
for (i = 0; i < number_count; i++) { for (size_t i = 0; i < in.number_count; i++) {
cin >> numbers[i]; cin >> in.numbers[i];
} }
double min = numbers[0]; return in;
double max = numbers[0]; }
for (double x : numbers) {
if (x < min) { void
min = x; find_minmax(const vector<double>& numbers, double& min, double& max) {
} min = numbers[0];
else if (x > max) { max = numbers[0];
max = x; for (double x : numbers)
} {
} if (x < min) min = x;
double bin_size = (max - min) / bin_count; else if (x > max) max = x;
for (size_t i = 0; i < number_count; i++) { }
bool found = false; }
for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
double lo = min + j * bin_size; vector <size_t>
double hi = min + (j + 1) * bin_size; make_histogram(const vector<double>& numbers, size_t bucket, size_t number_count) {
if ((lo <= numbers[i]) && (numbers[i] < hi)) { vector <size_t> stolb(bucket);
bins[j]++; double min, max;
found = true; find_minmax(numbers, min, max);
} float k = (max - min) / bucket;
} for (size_t i = 0; i < bucket; i++) stolb[i] = 0;
if (!found) { for (size_t i = 0; i < number_count; i++)
bins[bin_count - 1]++; {
} bool flag = false;
} for (size_t j = 0; (j < bucket && !flag); j++)
int maxlen = 0; {
for (int j = 0; j < bin_count; j++) if (numbers[i] >= (min + k * j) && numbers[i] < (min + k * (1 + j)))
{ {
if (maxlen < bins[j]) maxlen = bins[j]; stolb[j]++;
} flag = true;
for (int j = 0; j < bin_count; j++)
{ }
if (bins[j] < 100) cout << " "; }
if (bins[j] < 10) cout << " "; if (!flag) stolb[bucket - 1]++;
cout << bins[j] << "|"; }
size_t height = bins[j]; return stolb;
if (maxlen > MAX_ASTERISK) }
{
if (maxlen != bins[j]) height = MAX_ASTERISK * (static_cast<float>(bins[j]) / maxlen); void
else if (maxlen == bins[j]) height = MAX_ASTERISK; show_histogram_text(vector <size_t> stolb, size_t bucket) {
} const size_t SCREEN_WIDTH = 80;
for (int i = 0; i < height; i++) cout << "*"; const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
cout << "\n"; int maxlen = 0;
}
return 0; for (int j = 0; j < bucket; j++)
} {
if (maxlen < stolb[j]) maxlen = stolb[j];
}
for (int j = 0; j < bucket; j++)
{
if (stolb[j] < 100) cout << " ";
if (stolb[j] < 10) cout << " ";
cout << stolb[j] << "|";
size_t height = stolb[j];
if (maxlen > MAX_ASTERISK)
{
if (maxlen != stolb[j]) height = MAX_ASTERISK * (static_cast <float> (stolb[j]) / maxlen);
else if (maxlen == stolb[j]) height = MAX_ASTERISK;
}
for (int i = 0; i < height; i++) cout << "*";
cout << "\n";
}
}
int main()
{
auto in = input_data();
auto stolb = make_histogram(in.numbers, in.bucket, in.number_count);
show_histogram_text(stolb, in.bucket);
return 0;
}

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