code: добавление файла программы

master
Daniel (IvanovDA) 1 год назад
Сommit b4af8f2525

@ -0,0 +1,74 @@
#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;
cerr << "Enter amount of numbers \n";
cin >> number_count;
vector<double> numbers(number_count);
for (size_t i = 0; i < number_count; i++){
cerr << "Input number " << i+1 << endl;
cin >> numbers[i];
}
double minc, maxc;
minc = maxc = numbers[0];
for (size_t i = 1; i < number_count; i++ ){
if(numbers[i] < minc){
minc = numbers[i];
}
else if (numbers[i] > maxc){
maxc = numbers[i];
}
}
size_t bin_count;
cerr << "Input number of bins \n";
cin >> bin_count;
vector<size_t> bins(bin_count);
double bin_size = (maxc - minc) / bin_count;
size_t bin_max_size = 0;
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 = minc + j * bin_size;
auto hi = minc + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) {
bins[j]++;
found = true;
if (bins[j]> bin_max_size){
bin_max_size = bins[j];
}
}
}
if (!found) {
bins[bin_count - 1]++;
if (bins[bin_count - 1]> bin_max_size){
bin_max_size = bins[bin_count - 1];
}
}
}
double k = double(MAX_ASTERISK) / bin_max_size;
if (k>1){
k = 1;
}
// vector <size_t> bin_graph(bin_count);
// for (size_t bin = 0; bin < bin_count; bin++){
// bin_graph[bin] = int(float (bins[bin]) * k);
// }
for (size_t bin = 0; bin < bin_count; bin++){
if (bins[bin] < 100){
cout << " ";
}
if (bins[bin] < 10){
cout << " ";
}
cout << bins[bin] << "|";
for (size_t i = 0; i < bin * k; i++){
cout << "*";
}
cout << endl;
}
return 0;
}
Загрузка…
Отмена
Сохранить