work: сохранение проекта
Этот коммит содержится в:
78
main.cpp
78
main.cpp
@@ -3,43 +3,63 @@
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main()
|
||||
{
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
|
||||
struct Input {
|
||||
vector<double> numbers;
|
||||
size_t bin_count{};
|
||||
size_t number_count{};
|
||||
size_t max_count{};
|
||||
};
|
||||
|
||||
Input
|
||||
input_data() {
|
||||
Input in;
|
||||
cerr << "Enter number count: ";
|
||||
cin >> number_count;
|
||||
vector<double> numbers(number_count);
|
||||
for (size_t i = 0; i < number_count; i++) {
|
||||
cin >> numbers[i];
|
||||
cerr << "Enter bin count: ";
|
||||
cin >> bin_count;
|
||||
max_count = 0;
|
||||
cin >> in.number_count;
|
||||
|
||||
|
||||
vector<double> numbers(in.number_count);
|
||||
in.numbers.resize(in.number_count);
|
||||
for (size_t i = 0; i < in.number_count; i++) {
|
||||
cin >> in.numbers[i];
|
||||
}
|
||||
size_t mn = numbers[0];
|
||||
size_t
|
||||
mx = numbers[0];
|
||||
|
||||
size_t bin_count;
|
||||
cerr << "Enter bin count: ";
|
||||
cin >> in.bin_count;
|
||||
|
||||
size_t max_count;
|
||||
in.max_count = 0;
|
||||
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 < mn){
|
||||
mn = x;
|
||||
if (x < min){
|
||||
min = x;
|
||||
}
|
||||
else if (x > mx){
|
||||
mx = x;
|
||||
else if (x > max){
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
double bin_size = (mx - mn) / bin_count;
|
||||
}
|
||||
|
||||
vector <size_t>
|
||||
make_histogram(const vector<double>& numbers, size_t & bin_count, size_t & number_count, size_t & max_count) {
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
double bin_size = (max - min) / bin_count;
|
||||
vector<size_t> bins(bin_count);
|
||||
max_count = bins[0];
|
||||
for (size_t i = 0; i < number_count; i++){
|
||||
bool found = false;
|
||||
for (size_t j = 0; (j < bin_count - 1) && !found; j++){
|
||||
auto lo = mn + j * bin_size;
|
||||
auto hi = mn + (j + 1) * bin_size;
|
||||
auto lo = min + j * bin_size;
|
||||
auto hi = min + (j + 1) * bin_size;
|
||||
if ((lo <= numbers[i]) && (numbers[i] < hi)){
|
||||
bins[j]++;
|
||||
found = true;
|
||||
@@ -55,7 +75,14 @@ int main()
|
||||
max_count = bins[bin_count - 1];
|
||||
}
|
||||
}
|
||||
if (max_count > MAX_ASTERISK){
|
||||
return bins;
|
||||
}
|
||||
|
||||
void
|
||||
show_histogram_text(vector<size_t>& bins, size_t & max_count,size_t & bin_count){
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
if (max_count > MAX_ASTERISK){
|
||||
vector<size_t> hights(bin_count);
|
||||
for (size_t i = 0; i < bin_count; i++){
|
||||
size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
|
||||
@@ -80,4 +107,11 @@ int main()
|
||||
cout << endl;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
int main()
|
||||
{
|
||||
auto in = input_data();
|
||||
auto bins = make_histogram(in.numbers, in.bin_count, in.number_count, in.max_count);
|
||||
show_histogram_text(bins, in.max_count, in.bin_count);
|
||||
}
|
||||
|
||||
11
project.cbp
11
project.cbp
@@ -33,7 +33,18 @@
|
||||
<Add option="-fexceptions" />
|
||||
</Compiler>
|
||||
<Unit filename=".gitignore" />
|
||||
<Unit filename="histogram.cpp" />
|
||||
<Unit filename="histogram.h">
|
||||
<Option target="<{~None~}>" />
|
||||
</Unit>
|
||||
<Unit filename="histogram_internal.h">
|
||||
<Option target="<{~None~}>" />
|
||||
</Unit>
|
||||
<Unit filename="main.cpp" />
|
||||
<Unit filename="text.cpp" />
|
||||
<Unit filename="text.h">
|
||||
<Option target="<{~None~}>" />
|
||||
</Unit>
|
||||
<Extensions>
|
||||
<lib_finder disable_auto="1" />
|
||||
</Extensions>
|
||||
|
||||
Ссылка в новой задаче
Block a user