Andrey 2 лет назад
Родитель ade892e744
Сommit 19165482b1

@ -33,6 +33,9 @@
<Add option="-fexceptions" /> <Add option="-fexceptions" />
</Compiler> </Compiler>
<Unit filename=".gitignore" /> <Unit filename=".gitignore" />
<Unit filename="histogram.h">
<Option target="&lt;{~None~}&gt;" />
</Unit>
<Unit filename="main.cpp" /> <Unit filename="main.cpp" />
<Extensions> <Extensions>
<lib_finder disable_auto="1" /> <lib_finder disable_auto="1" />

@ -4,30 +4,33 @@
using namespace std; using namespace std;
struct Input { struct
Input
{
vector<double> numbers; vector<double> numbers;
size_t bin_count{}; size_t bin_count{};
}; };
Input Input
input_data(){ input_data()
{
size_t number_count; size_t number_count;
cin >> number_count; cin >> number_count;
Input in; Input in;
in.numbers.resize(number_count); in.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 >> in.numbers[i];
} }
size_t bin_count;
cin >> in.bin_count; cin >> in.bin_count;
return in; return in;
} }
void find_minmax(const vector<double> numbers, double& min, double& max) void
{ find_minmax(const vector<double>& numbers, double& min, double& max)
{
max = numbers[0]; max = numbers[0];
min = numbers[0]; min = numbers[0];
for(size_t i = 0; i < numbers.size(); i++) for(size_t i = 0; i < numbers.size(); i++)
@ -35,47 +38,45 @@ using namespace std;
if (numbers[i] > max) max = numbers[i]; if (numbers[i] > max) max = numbers[i];
if (numbers[i] < min) min = numbers[i]; if (numbers[i] < min) min = numbers[i];
} }
} }
vector<double> make_histogram(const vector<double> numbers, size_t bin_count) void
{ make_histogram(vector<double>& bins, Input in)
{
double min, max; double min, max;
find_minmax(numbers, min, max); find_minmax(in.numbers, min, max);
vector<double> bins; size_t cor_size = (max - min)/in.bin_count;
size_t cor_size = (max - min)/bin_count;
for (size_t i = 0; i < numbers.size(); i++) for (size_t i = 0; i < in.numbers.size(); i++)
{ {
bool flag = false; bool flag = false;
for (size_t j = 0; (j < bin_count - 1) && !flag; j++) for (size_t j = 0; (j < in.bin_count) && !flag; j++)
{ {
auto L = min + j*cor_size; auto L = min + j*cor_size;
auto H = min + (j+1)*cor_size; auto H = min + (j+1)*cor_size;
if ((L <= numbers[i]) && (numbers[i] < H)) if ((L <= in.numbers[i]) && (in.numbers[i] <= H))
{ {
flag = true; flag = true;
bins[j]++; bins[j]++;
} }
} }
if (!flag) bins[bin_count-1]++; if (!flag) bins[in.bin_count-1]++;
}
return bins;
} }
}
void show_histogram_text(vector<double> bins, const vector<double> numbers, size_t bin_count) void
{ show_histogram_text(vector<double> bins, Input in)
{
const size_t MAX_ASTERISK = 76; const size_t MAX_ASTERISK = 76;
int maxb = bins[0]; int maxb = bins[0];
size_t H; size_t H;
for (size_t j = 1; j < bin_count; j++) for (size_t j = 1; j < in.bin_count; j++)
{ {
if (bins[j] > maxb) maxb = bins[j]; if (bins[j] > maxb) maxb = bins[j];
} }
for (size_t j = 0; j < bin_count; j++) for (size_t j = 0; j < in.bin_count; j++)
{ {
if (maxb > MAX_ASTERISK) if (maxb > MAX_ASTERISK)
{ {
@ -88,27 +89,14 @@ using namespace std;
for (size_t i = 0; i < H; i++) cout << "*"; for (size_t i = 0; i < H; i++) cout << "*";
cout << endl; cout << endl;
} }
} }
///////////////////////////////////////////////////////// int
int main() main()
{ {
auto in = input_data(); auto in = input_data();
///////////////////////////////////////////////////////// vector<double> bins;
if (in.bin_count == 0) bins.resize(in.bin_count);
{ make_histogram(bins, in);
in.bin_count = sqrt(in.numbers.size()); show_histogram_text(bins, in);
if (in.bin_count > 25)
{
in.bin_count = 1 + log2(in.numbers.size());
cout << "sterg";
}
else cout << "empirii";
cout << endl;
}
/////////////////////////////////////////////////////////
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.numbers, in.bin_count);
return 0;
} }

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