code: заготовка программы

main
Александр Чирка 7 дней назад
Сommit 6ccd55901e

@ -0,0 +1,38 @@
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<CodeBlocks_project_file>
<FileVersion major="1" minor="6" />
<Project>
<Option title="lab01" />
<Option pch_mode="2" />
<Option compiler="gcc" />
<Build>
<Target title="Debug">
<Option output="bin/Debug/lab01" 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/lab01" 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 />
</Project>
</CodeBlocks_project_file>

@ -0,0 +1,137 @@
#include <iostream>
#include <vector>
using namespace std;
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
void indent(int number)
{
if (number < 10)
{
cout << " ";
}
else if (number < 100)
{
cout << " ";
}
else
{
cout << "";
}
}
int main()
{
size_t number_count;
cerr << "Enter number count: ";
cin >> number_count;
vector<double> numbers(number_count);
for (size_t i = 0; i < number_count; i++)
{
cerr << "Enter numbers: ";
cin >> numbers[i];
}
size_t bin_count;
cerr << "Enter bin count: ";
cin >> bin_count;
vector<size_t> bins(bin_count);
double min = numbers[0];
double max = numbers[0];
for (double x : numbers)
{
if (x < min)
{
min = x;
}
else if (x > max)
{
max = x;
}
}
size_t max_count = 0;
double bin_size = (max - min) / 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 = min + j * bin_size;
auto hi = min + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi))
{
bins[j]++;
if (bins[j] > max_count)
{
max_count = bins[j];
}
found = true;
}
}
if (!found)
{
bins[bin_count - 1]++;
if (bins[bin_count - 1] > max_count)
{
max_count = bins[bin_count - 1];
}
}
}
for (int row = 0; row < max_count; row++) {
for (int i = 0; i < bin_count; i++) {
if (bins[i] >= row + 1) {
cout << "*";
}
else {
cout << " ";
}
}
cout << endl;
}
return 0;
/*
if (max_count <= 76)
{
for (size_t i = 0; i < bin_count; i++)
{
indent(bins[i]);
cout << bins[i] << "|";
for (size_t j = 0; j < bins[i]; j++)
{
cout << "*";
}
cout << endl;
}
}
else
{
for (size_t i = 0; i < bin_count; i++)
{
size_t height = 76 * (static_cast<double>(bins[i]) / max_count);
indent(bins[i]);
cout << bins[i] << "|";
for (size_t j = 0; j < height; j++)
{
cout << "*";
}
cout << endl;
}
}
return 0;
*/
}
Загрузка…
Отмена
Сохранить