code: first code(laba N 3)
Этот коммит содержится в:
87
main.cpp
87
main.cpp
@@ -1,48 +1,57 @@
|
|||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
#include <math.h>
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
const size_t SCREEN_WIDTH = 80;
|
struct Input {
|
||||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
vector<double> numbers;
|
||||||
int main()
|
size_t bin_count{};
|
||||||
{
|
};
|
||||||
|
Input
|
||||||
|
input_data() {
|
||||||
size_t number_count;
|
size_t number_count;
|
||||||
|
|
||||||
cout << "Enter number count: ";
|
|
||||||
cin >> number_count;
|
cin >> number_count;
|
||||||
|
Input in;
|
||||||
vector<double> numbers(number_count);
|
in.numbers.resize(number_count);
|
||||||
numbers.resize(number_count);
|
for (size_t i = 0; i < number_count; i++) {
|
||||||
for(size_t i=0;i<number_count;i++)
|
cin >> in.numbers[i];
|
||||||
{
|
|
||||||
cin>>numbers[i];
|
|
||||||
}
|
}
|
||||||
size_t bin_count;
|
size_t bin_count;
|
||||||
cin>>bin_count;
|
cin >> in.bin_count;
|
||||||
vector<size_t> bins(bin_count);
|
return in;
|
||||||
double Max = numbers[0], Min = numbers[0];
|
}
|
||||||
for (double x : numbers)
|
void
|
||||||
|
find_minmax(const vector<double>& numbers, double& Min, double& Max) {
|
||||||
|
Min = numbers[0];
|
||||||
|
Max = numbers[0];
|
||||||
|
for(size_t x : numbers)
|
||||||
{
|
{
|
||||||
if (x < Min)
|
if(x < Min)
|
||||||
{
|
{
|
||||||
Min = x;
|
Min = x;
|
||||||
}
|
}else
|
||||||
else if (x > Max)
|
|
||||||
{
|
{
|
||||||
Max = x;
|
if(x > Max)
|
||||||
|
{
|
||||||
|
Max = x;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
vector<size_t>
|
||||||
|
make_histogram(vector<double> numbers, size_t bin_count)
|
||||||
|
{
|
||||||
|
std::vector<size_t> bins(bin_count);
|
||||||
|
double Min, Max;
|
||||||
|
find_minmax(numbers, Min, Max);
|
||||||
double bin_size = (Max - Min) / bin_count;
|
double bin_size = (Max - Min) / bin_count;
|
||||||
//cout<<" "<<Max<<" "<<Min<<" "<<bin_size<<endl;
|
for (double x : numbers)
|
||||||
|
|
||||||
for (size_t i = 0; i < number_count; 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 = Min + j * bin_size;
|
||||||
auto hi = Min + (j + 1) * bin_size;
|
auto hi = Min + (j + 1) * bin_size;
|
||||||
if ((lo <= numbers[i]) && (numbers[i] < hi))
|
if ((lo <= x) && (x < hi))
|
||||||
{
|
{
|
||||||
bins[j]++;
|
bins[j]++;
|
||||||
found = true;
|
found = true;
|
||||||
@@ -53,27 +62,11 @@ int main()
|
|||||||
bins[bin_count - 1]++;
|
bins[bin_count - 1]++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
size_t Max_count = bins[0];
|
return bins;
|
||||||
for(size_t x : bins)
|
}
|
||||||
{
|
int main()
|
||||||
if(x > Max_count)
|
{
|
||||||
{
|
auto in = input_data();
|
||||||
Max_count = x;
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
||||||
}
|
|
||||||
}
|
|
||||||
for(size_t i =0;i< bin_count;i++)
|
|
||||||
{
|
|
||||||
size_t height = bins[i];
|
|
||||||
printf("%3d:",bins[i]);
|
|
||||||
if(Max_count>(MAX_ASTERISK))
|
|
||||||
{
|
|
||||||
height = (MAX_ASTERISK) * (static_cast<double>(bins[i]) / Max_count);
|
|
||||||
}
|
|
||||||
for(size_t j=0;j<height; j++)
|
|
||||||
{
|
|
||||||
cout<<"*";
|
|
||||||
}
|
|
||||||
cout<<endl;
|
|
||||||
}
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|||||||
Ссылка в новой задаче
Block a user