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

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

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

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