main
Родитель
ebe92e673c
Сommit
8f0802df87
@ -1,117 +1,66 @@
|
|||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
#include <conio.h>
|
||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
const size_t SCREEN_WIDTH = 80;
|
|
||||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
||||||
|
|
||||||
|
|
||||||
double findMin(vector<double> values)
|
|
||||||
{
|
|
||||||
double min;
|
|
||||||
min = values[0];
|
|
||||||
for (size_t i = 1; i < values.size(); i++)
|
|
||||||
if (values[i] < min)
|
|
||||||
min = values[i];
|
|
||||||
return min;
|
|
||||||
}
|
|
||||||
|
|
||||||
double findMax(vector<double> values)
|
int main()
|
||||||
{
|
{
|
||||||
double max;
|
size_t number_count;
|
||||||
max = values[0];
|
|
||||||
for (size_t i = 1; i < values.size(); i++)
|
|
||||||
if (values[i] > max)
|
|
||||||
max = values[i];
|
|
||||||
return max;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t findMax(vector<size_t> values)
|
cerr << "Enter number count: "; //количество чисел
|
||||||
{
|
cin >> number_count;
|
||||||
size_t max;
|
|
||||||
max = values[0];
|
|
||||||
for (size_t i = 1; i < values.size(); i++)
|
|
||||||
if (values[i] > max)
|
|
||||||
max = values[i];
|
|
||||||
return max;
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<size_t> GetCarts(vector<double> values, size_t cartsCount)
|
vector<double> numbers(number_count); //векток с числами
|
||||||
{
|
|
||||||
vector<size_t> carts(cartsCount);
|
|
||||||
double min = findMin(values);
|
|
||||||
double max = findMax(values);
|
|
||||||
double step = (max - min) / cartsCount;
|
|
||||||
for (size_t i = 0; i < values.size(); i++)
|
|
||||||
{
|
|
||||||
bool found = false;
|
|
||||||
for (size_t j = 0; (j < cartsCount - 1) && !found; j++)
|
|
||||||
{
|
|
||||||
auto lo = min + j * step;
|
|
||||||
auto hi = min + (j + 1) * step;
|
|
||||||
if ((lo <= values[i]) && (values[i] < hi))
|
|
||||||
{
|
|
||||||
carts[j]++;
|
|
||||||
found = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!found)
|
|
||||||
carts[cartsCount - 1]++;
|
|
||||||
}
|
|
||||||
return carts;
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<double> inputValues()
|
for(size_t i=0; i < number_count; i++) //заполнение вектора
|
||||||
{
|
cin >> numbers[i];
|
||||||
size_t valuesLen;
|
|
||||||
cin >> valuesLen;
|
|
||||||
vector<double> values(valuesLen);
|
|
||||||
for (size_t i = 0; i < valuesLen; i++)
|
|
||||||
cin >> values[i];
|
|
||||||
return values;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t inputCartsCount()
|
size_t bin_count; //количество корзин
|
||||||
{
|
cerr << "Enter bin count: ";
|
||||||
size_t cartsCount;
|
cin >> bin_count;
|
||||||
cin >> cartsCount;
|
|
||||||
return cartsCount;
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<size_t> ScaleCart(vector<size_t> carts, size_t max)
|
vector<size_t> bins(bin_count);
|
||||||
{
|
|
||||||
if (max < MAX_ASTERISK)
|
|
||||||
max = MAX_ASTERISK;
|
|
||||||
vector<size_t> cartsScales(carts.size());
|
|
||||||
for (size_t i = 0; i < carts.size(); i++)
|
|
||||||
cartsScales[i] = MAX_ASTERISK * (static_cast<double>(carts[i]) / max);
|
|
||||||
return cartsScales;
|
|
||||||
}
|
|
||||||
|
|
||||||
void outputCarts(vector<size_t> carts)
|
double min;
|
||||||
{
|
min = numbers[0];
|
||||||
size_t max = findMax(carts);
|
for (size_t i = 1; i < numbers.size(); i++)
|
||||||
vector<size_t> cartsScales = ScaleCart(carts, max);
|
if (numbers[i] < min)
|
||||||
for (size_t i = 0; i < carts.size(); i++)
|
min = numbers[i];
|
||||||
{
|
|
||||||
if (carts[i] < 100)
|
|
||||||
cout << " ";
|
double max;
|
||||||
if (carts[i] < 10)
|
max = numbers[0];
|
||||||
cout << " ";
|
for (size_t i = 1; i < numbers.size(); i++)
|
||||||
cout << carts[i] << "|";
|
if (numbers[i] > max)
|
||||||
for (size_t j = 0; j < cartsScales[i]; j++)
|
max = numbers[i];
|
||||||
cout << "*";
|
|
||||||
cout << endl;
|
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]++;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
int main()
|
for (size_t i=0; i<bins.size(); i++)
|
||||||
{
|
{cout << bins[i] << "|";
|
||||||
vector<double> values = inputValues();
|
for (size_t j=0; j<bins[i]; j++)
|
||||||
size_t cartsCount = inputCartsCount();
|
cout << "*";
|
||||||
vector<size_t> carts = GetCarts(values, cartsCount);
|
cout << "\n" ;
|
||||||
outputCarts(carts);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
Загрузка…
Ссылка в новой задаче