build: ЛР1 без изменений

master
Alexander (AntonovichAN) 7 месяцев назад
Сommit cff0d12e63

6
.gitignore поставляемый

@ -0,0 +1,6 @@
/bin
/obj
/lab01.layout
/lab01.depend
/main.exe
/main.o

@ -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,92 @@
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 4;
int main() {
size_t number_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];
}
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 bin_count;
cerr << "Enter bin count: ";
cin >> bin_count;
if (bin_count == 0) {
bin_count = int(sqrt(number_count));
if (bin_count > 25) {
bin_count = int(1 + log2(number_count));
cerr << "Calculated " << bin_count << " bins with Sturges' formula" << endl;
}
else {
cerr << "Calculated " << bin_count << " bins with Empiric formula" << endl;
}
}
vector<size_t> bins(bin_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]++;
found = true;
}
}
if (!found) {
bins[bin_count - 1]++;
}
}
size_t maxbin = bins[0];
for (size_t i=1; i < bins.size(); i++){
if (maxbin < bins[i]){
maxbin = bins[i];
}
}
if (maxbin <= MAX_ASTERISK){
for (size_t i = 0; i < bins.size(); i++) {
cout.width(4);
cout << bins[i] << "|";
for (size_t j = 0; j < bins[i]; j++) {
cout << "*";
}
cout << endl;
}
return 0;
} else {
for (size_t i = 0; i < bins.size(); i++) {
cout.width(4);
cout << bins[i] << "|";
size_t height = static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / maxbin));
for (size_t j = 0; j < height; j++) {
cout << "*";
}
cout << endl;
}
return 0;
}
}
Загрузка…
Отмена
Сохранить