code: достигнута корректная работа программы

master
unknown 5 месяцев назад
Родитель 25d079beb3
Сommit b996698d31

4
.gitignore поставляемый

@ -0,0 +1,4 @@
/bin
/obj
*.depend
*.layout

@ -1,41 +1,52 @@
#include <iostream> #include <iostream>
#include <vector> #include <vector>
#include <math.h> #include <math.h>
#pragma once
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;
cerr << "Enter number count: "; Input input_data(){
size_t number_count;
cin >> number_count; cin >> number_count;
cerr << "Enter bin count: "; Input in;
cin >> bin_count; in.numbers.resize(number_count);
vector<double> numbers(number_count); for (size_t i = 0; i < number_count; i++){
vector<size_t> bins(bin_count); cin >> in.numbers[i];
cerr << "Enter numbers: "; }
for (size_t i = 0; i < number_count; i++) { cin >> in.bin_count;
cin >> numbers[i]; return in;
} }
double min = numbers[0];
double max = numbers[0]; void find_minmax(const vector<double>& numbers, double& min, double& max) {
for (double x : numbers) { min = numbers[0];
if (x < min) { max = numbers[0];
for (double x : numbers){
if (x < min){
min = x; min = x;
} }
else if (x > max) { else if (x > max){
max = x; max = x;
} }
} }
double bin_size = (max - min) / bin_count; return;
for (size_t i = 0; i < number_count; i++) { }
vector<size_t> make_histogram(const vector<double>& numbers, size_t& bin_count) {
double minn, maxn;
find_minmax(numbers, minn, maxn);
double bin_size = (maxn - minn) / bin_count;
vector<size_t> bins(bin_count, 0);
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 = min + j * bin_size; auto lo = minn + j * bin_size;
auto hi = min + (j + 1) * bin_size; auto hi = minn + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) { if ((numbers[i] >= lo) && (numbers[i] <= hi)) {
bins[j]++; bins[j]++;
found = true; found = true;
} }
@ -44,81 +55,86 @@ int main()
bins[bin_count - 1]++; bins[bin_count - 1]++;
} }
} }
return bins;
}
void show_histogram_text(const vector<size_t> bins, size_t bin_count) {
size_t max_count = bins[0]; size_t max_count = bins[0];
size_t count = 0; for (size_t i = 1; i < bin_count; i++) {
short space_count; if (bins[i] > max_count) {
for (size_t x : bins) { max_count = bins[i];
if (x > max_count) {
max_count = x;
} }
} }
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
short space_count;
cerr << "\nHistogram:" << endl;
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++) {
if (bins[i] < 10) { if (bins[i] < 10) {
space_count = 2; space_count = 2;
} else if (bins[i] >= 10 && bins[i] < 100) { } else if (bins[i] >= 10 && bins[i] < 100) {
space_count = 1; space_count = 1;
} else { } else if (bins[i] >= 100 && bins[i] < 1000) {
space_count = 0; space_count = 0;
} }
for (size_t k = 0; k < space_count; k++) { for (size_t k = 0; k < space_count; k++) {
cout << " "; cout << " ";
} }
cout << bins[i]; cout << bins[i];
cout << "|"; cout << "|";
if (i == 0){
for (size_t j = 0; j < bins[i]; j++) {
if (j != bins[i+1]) {
cout << "*";
} else if (j == bins[i+1]){
cout << "V";
}
}
} else if (i == bin_count-1){
for (size_t j = 0; j < bins[i]; j++) {
if (j != bins[i-1]) {
cout << "*";
} else if (j == bins[i-1]){
cout << "^";
}
}
} else {
for (size_t j = 0; j < bins[i]; j++) { for (size_t j = 0; j < bins[i]; j++) {
if (j != bins[i-1]-1 && j != bins[i+1]-1) {
cout << "*"; cout << "*";
} else if (j == bins[i-1]-1 && j == bins[i+1]-1){
cout << "N";
} else if (j == bins[i-1]-1){
cout << "^";
} else if (j == bins[i+1]-1){
cout << "V";
}
}
} }
cout << "\n"; cout << "\n";
} }
} /*else { } else {
for (size_t i = 0; i < bin_count; i++) { for (size_t i = 0; i < bin_count; i++) {
if (bins[i] < 10) { if (bins[i] < 10) {
space_count = 2; space_count = 2;
} else if (bins[i] >= 10 && bins[i] < 100) { } else if (bins[i] >= 10 && bins[i] < 100) {
space_count = 1; space_count = 1;
} else { } else if (bins[i] >= 100 && bins[i] < 1000) {
space_count = 0; space_count = 0;
} }
for (size_t k = 0; k < space_count; k++) { for (size_t k = 0; k < space_count; k++) {
cout << " "; cout << " ";
} }
cout << bins[i]; cout << bins[i];
cout << "|"; cout << "|";
size_t height = static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count)); size_t height = static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count));
for (size_t j = 0; j < height; j++) { for (size_t j = 0; j < height; j++) {
cout << "*"; cout << "*";
} }
cout << "\n"; cout << "\n";
} }
}*/ }
system("pause"); }
int main() {
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
return 0; return 0;
} }

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