Kuzin 2 лет назад
Сommit 665188117e

@ -0,0 +1,40 @@
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<CodeBlocks_project_file>
<FileVersion major="1" minor="6" />
<Project>
<Option title="Lab_1" />
<Option pch_mode="2" />
<Option compiler="gcc" />
<Build>
<Target title="Debug">
<Option output="bin/Debug/Lab_1" prefix_auto="1" extension_auto="1" />
<Option object_output="obj/Debug/" />
<Option type="1" />
<Option compiler="gcc" />
<Compiler>
<Add option="-g" />
</Compiler>
</Target>
<Target title="Release">
<Option output="bin/Release/Lab_1" prefix_auto="1" extension_auto="1" />
<Option object_output="obj/Release/" />
<Option type="1" />
<Option compiler="gcc" />
<Compiler>
<Add option="-O2" />
</Compiler>
<Linker>
<Add option="-s" />
</Linker>
</Target>
</Build>
<Compiler>
<Add option="-Wall" />
<Add option="-fexceptions" />
</Compiler>
<Unit filename="main.cpp" />
<Extensions>
<lib_finder disable_auto="1" />
</Extensions>
</Project>
</CodeBlocks_project_file>

@ -0,0 +1,89 @@
#include <iostream>
#include <vector>
using namespace std;
int main()
{
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
size_t number_count, bin_count, max_bin, height;
double maxx, minn;
cerr << "Enter number count: "; cin >> number_count; //Êîë-âî ÷èñåë
vector <double> numbers(number_count);
for (int i = 0; i < number_count; i++)
{
cerr << "Enter Num[" << i << "]: "; cin >> numbers[i]; //Ââîä ÷èñåë
}
cerr << "Enter bin count: "; cin >> bin_count; //Êîë-âî êîðçèí
vector <size_t> bins(bin_count);
maxx = numbers[0]; minn = numbers[1];
for (size_t i = 0; i < number_count; i++)
{
if (maxx < numbers[i])
maxx = numbers[i];
if (minn > numbers[i])
minn = numbers[i];
}
double bin_size = (maxx - minn) / bin_count;
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 = minn + j * bin_size;
auto hi = minn + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi))
{
bins[j]++;
found = true;
}
}
if (!found)
{
bins[bin_count - 1]++;
}
}
max_bin = bins[0];
height = bins[0];
for (size_t i = 0; i < bin_count; i++)
{
if (bins[i] > max_bin)
max_bin = bins[i];
}
bool flag = false;
if ( max_bin > 80)
{
flag = true;
}
for (size_t i = 0; i < bin_count; i++)
{
if (bins[i] < 100)
cout << " ";
if (bins[i] < 10)
cout << " ";
cout << bins[i] << "|";
if( flag == true)
{
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_bin);
}
else
{
height = bins[i];
}
for (size_t j = 0; j < height; j++)
{
cout << "*";
}
cout << endl;
if ((bin_count - i) != 1)
cout << minn + bin_size * (i+1) << endl;
}
return 0;
}
Загрузка…
Отмена
Сохранить