Сравнить коммиты

...

2 Коммитов

@ -2,30 +2,30 @@
#include <iostream>
using namespace std;
int main()
struct Input
{
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
vector<double> numbers;
size_t bin_count{};
};
Input input_data()
{
Input in;
size_t number_count;
cerr << "Enter number count: ";
cin >> number_count;
vector<double> numbers(number_count);
in.numbers.resize(number_count);
cerr << "Enter numbers: ";
for (size_t i = 0; i < number_count; i++)
{
cin >> numbers[i];
for (size_t i = 0; i < number_count; i++) {
cin >> in.numbers[i];
}
size_t bin_count;
cerr << "Enter bin count: ";
cin >> bin_count;
vector<size_t> bins(bin_count, 0);
double min = numbers[0];
double max = numbers[0];
cin >> in.bin_count;
return in;
}
void find_minmax(const vector<double>& numbers, double& min, double& max) {
min = numbers[0];
max = numbers[0];
for (double x : numbers)
{
if (x < min)
@ -37,6 +37,44 @@ int main()
max = x;
}
}
}
int main()
{
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
Input in = input_data();
//
size_t number_count;
cerr << "Enter number count: ";
cin >> number_count;
vector<double> numbers(number_count);
cerr << "Enter numbers: ";
for (size_t i = 0; i < number_count; i++)
{
cin >> numbers[i];
}
size_t bin_count;
cerr << "Enter bin count: ";
cin >> bin_count;
//
vector<size_t> bins(bin_count, 0);
double min, max;
find_minmax(in.numbers, min, max);
// double min = numbers[0];
// double max = numbers[0];
//for (double x : numbers)
// {
// if (x < min)
// {
// min = x;
// }
// else if (x > max)
// {
// max = x;
// }
// }
double bin_size = (max - min) / bin_count;

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