EfremovSI 1 год назад
Сommit a80c85ec3d

@ -0,0 +1,40 @@
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<CodeBlocks_project_file>
<FileVersion major="1" minor="6" />
<Project>
<Option title="lab003" />
<Option pch_mode="2" />
<Option compiler="gcc" />
<Build>
<Target title="Debug">
<Option output="bin/Debug/lab003" 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/lab003" 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,117 @@
#include <iostream>
#include <vector>
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
using namespace std;
int main()
{
size_t number_count, bin_count, max_count;
cerr << "Enter number count: ";
cin >> number_count;
vector<double> numbers(number_count);
cerr << "Enter numbers: ";
for (size_t i = 0; i < number_count; i++){
cin >> numbers[i];
}
cerr << "Enter bin count: ";
cin >> 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;
}
}
vector<size_t> bins(bin_count);
vector<size_t> procent(bin_count);
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]++;
found = true;
}
}
if (!found) {
bins[bin_count - 1]++;
}
}
double sum = 0;
for (size_t i = 0; i < bin_count; i++){
sum = sum + bins[i];
}
double ost = 100;
for (size_t i = 0; i< bin_count-1; i++){
procent[i]=(bins[i]/sum)*100;
ost = ost - procent[i];
}
procent[bin_count-1]=ost;
max_count = 0;
for (size_t x: bins) {
if (x > max_count) {
max_count = x;
}
}
if (max_count > MAX_ASTERISK) {
for (size_t i = 0; i < bin_count ; i++) {
size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
if (bins[i] < 10) {
cout << " " << procent[i] << "%|";
}
else if (bins[i] >= 100) {
cout << procent[i] << "%|";
}
else {
cout << " " << procent[i] << "%|";
}
for (size_t i = 0; i < height; i++) {
cout << "*";
}
cout << "\n";
}
}
else {
for (size_t i = 0; i < bin_count; i++) {
if (procent[i] < 10) {
cout << " " << procent[i] << "%|";
}
else if (procent[i] < 100){
cout << " " << procent[i] << "%|";
}
else if (procent[i] = 100){
cout << procent[i] << "%|";
}
for (size_t r = 0; r < bins[i]; r++)
cout << "*";
cout << "\n";
}
}
return 0;
}
Загрузка…
Отмена
Сохранить