1. Импорт кода ЛР № 1 в Git

main
MatusSV 12 месяцев назад
Сommit 8d01744e6d

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

@ -0,0 +1,87 @@
#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;
size_t bin_count;
cerr << "Enter number count: ";
cin >> number_count;
vector<double> numbers(number_count);
for (size_t i = 0; i < number_count; i++)
cin >> numbers[i];
double min = numbers[0];
double max = numbers[0];
double max_count = 0;
for (double value : numbers)
{
if (value < min) {min = value;}
else if (value > max) {max = value;}
}
cerr << "Enter bins count: ";
cin >> bin_count;
vector<size_t> bins(bin_count);
double bin_size = (max - min) / bin_count;
for (size_t i = 0; i < number_count; i++)
{
for (size_t j = i + 1; j < number_count; j++)
{
if (numbers[i] == numbers[j])
{
//numbers.erase(numbers.begin() + j);
//number_count--;
//i--;
//cout << "Removed number " << numbers[j] << endl;
}
}
}
for (size_t i = 0; i < number_count; i++)
{
bool found = false;
for (size_t j = 0; (j < bin_count - 1) && !found; j++)
{
auto low_bound = min + j * bin_size;
auto high_bound = min + (j + 1) * bin_size;
if ((low_bound <= numbers[i]) && (numbers[i] < high_bound))
{
bins[j]++;
found = true;
if (bins[j] > max_count)
max_count = bins[j];
}
}
if (!found)
{
bins[bin_count - 1]++;
if (bins[bin_count - 1] > max_count)
max_count = bins[bin_count - 1];
}
}
for (size_t bin : bins)
{
if (bin < 100) cout << " ";
if (bin < 10) cout << " ";
cout << bin;
cout << "|";
size_t height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
if (max_count <= MAX_ASTERISK) height = bin;
for (size_t i = 0; i < height; i++) cout << "*";
cout << endl;
}
return 0;
}
Загрузка…
Отмена
Сохранить