Загрузил(а) файлы в ''

master
OgarkovIA 11 месяцев назад
Родитель 2061f1fe47
Сommit cc807145be

@ -1,119 +1,92 @@
#include <iostream> #include <iostream>
#include <vector> #include <vector>
using namespace std;
const size_t SCREEN_WIDTH = 80; const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
using namespace std; int main()
{
input_data() size_t number_count;
{ cerr << "Enter number count: ";
size_t number_count; cin >> number_count;
cin >> number_count;
vector<double> numbers(number_count); vector<double> numbers(number_count);
for (size_t i = 0; i < number_count; i++) { cerr << "Enter numbers: ";
cin >> numbers[i]; for(size_t i = 0; i < number_count; i++){
} cin >> numbers[i];
size_t bin_count; }
cin >> bin_count;
} size_t bin_count;
cerr << "Enter bin count: ";
cin >> bin_count;
int main()
{ double min = numbers[0];
Input in = input_data(); double max = numbers[0];
for (double x : numbers) {
if (x < min) {
min = x;
}
else if (x > max) {
double min = numbers[0]; max = x;
double max = numbers[0]; }
}
for (double x : numbers) { vector<size_t> bins(bin_count);
if (x < min) { double bin_size = (max-min)/bin_count;
min = x; for (size_t i = 0; i < number_count; i++) {
} bool found = false;
else if (x > max) { for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
max = x; auto lo = min + j * bin_size;
} auto hi = min + (j + 1) * bin_size;
} if ( (numbers[i] >= lo) && (numbers[i] < hi) ) {
bins[j]++;
/* found = true;
}
for (size_t i = 0; i < number_count; i++) { }
if (!found) {
} bins[bin_count-1]++;
}
*/ }
size_t max_count = bins[0];
vector<size_t> bins(bin_count); for(size_t x: bins){
double bin_size = (max - min) / bin_count; if(x > max_count){
max_count = x;
for (size_t i = 0; i < number_count; i++) { }
bool found = false; // òåêóùåå ñîñòîÿíèå òåêóùåãî ýëåìåíòà. Ýëåìåíò íå ðàñïðåäåëåí â êîðçèíó }
for (size_t j = 0; (j < bin_count - 1) && !found; j++) { // áåð¸ì j-þ êîðçèíó if (max_count > MAX_ASTERISK){
auto lo = min + j * bin_size; // îïðåäåëÿåì ãðàíèöû äàííîé êîðçèíû for(size_t count: bins){
auto hi = min + (j + 1) * bin_size; size_t height = MAX_ASTERISK * (static_cast<double>(count) /max_count);
if ((lo <= numbers[i]) && (numbers[i] < hi)) { // ïîäñòàâëÿåì ïîä ýòè ãðàíèöû i-é ýëåìåíò èç numbers if (count < 10){
bins[j]++; // åñëè ýëåìåíò íàõîäèòñÿ â äàííîì äèàïàçîíå (ãðàíèöàõ), òî óâåëè÷èâàåì ñ÷åò÷èê j-îé êîðçèíû cout << " " << count << "|";
found = true; // ïåðåêëþ÷àåì "ôëàæîê", ÷òîáû ïðåêðàòèòü ïåðåáîð êîðçèí è ïåðåéòè ê ñäåä. ýë. èç numbers }
} // òî åñòü òåïåðü ýëåìåíò ðàñïðåäåëåí â êîðçèíó è íåò íóæäû ïåðåáèðàòü îñòàëüíûå êîðçèíû else if (count < 100){
} cout << " " << count << "|";
if (!found) { // à åñëè æå âñ¸ òàêè ýë. íå ðàñïðåäåëåí, òî ýòî çíà÷èò, ÷òî îí ïîïàäàåò â ïîñëåäíèé äèàïàçîí }
bins[bin_count - 1]++; // äîáàâëÿåì ýòîò ýë. â ïîñëåäíþþ êîðçèíó else{
} cout << count << "|";
} }
for(size_t i = 0; i < height; i++){
// ïîäñ÷åò ìàêñèìàëüíîãî ðàçìåðà ñðåäè ðàçìåðîâ êîðçèí cout << "*";
max_count = 0; }
for (size_t x: bins) { cout << "\n";
if (x > max_count) { }
max_count = x; }
} else{
} for(double x : bins){
if (x < 10){
if (max_count > MAX_ASTERISK) { cout << " " << x << "|";
for (size_t count: bins) { }
size_t height = MAX_ASTERISK * (static_cast<double>(count) / max_count); else if (x < 100){
if (count < 10) { cout << " " << x << "|";
cout << " " << count << "|"; }
} else{
else if (count >= 100) { cout << x << "|";
cout << count << "|"; }
} for(size_t i = 0; i < x; i++){
cout << "*";
else { }
cout << " " << count << "|"; cout << "\n";
} }
}
for (size_t i = 0; i < height; i++) { return 0;
cout << "*"; }
}
cout << "\n";
}
}
else {
for (size_t x: bins) {
if (x < 10) {
cout << " " << x << "|";
}
else if (x >= 100) {
cout << x << "|";
}
else {
cout << " " << x << "|";
}
for (size_t i = 0; i < x; i++) {
cout << "*";
}
cout << "\n";
}
}
return 0;
}

Загрузка…
Отмена
Сохранить