|  |  | @ -0,0 +1,122 @@ | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | // lab1.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | //
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | #include <iostream> | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | #include <vector> | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | #include <cmath> | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | using namespace std; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | int main() | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     size_t number_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     size_t bin_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     cerr << "Enter number count:"; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     cin >> number_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     vector<double> numbers(number_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < number_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         cin >> numbers[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     cerr << "Enter number of bins:"; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     cin >> bin_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     vector<size_t> bins(bin_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     vector<size_t> binss(bin_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     float t = numbers[0]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < number_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         if (numbers[i] < t) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             t = numbers[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     float min = t; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     t = numbers[0]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < number_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         if (numbers[i] > t) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             t = numbers[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     float max = t; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     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]++; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < bin_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         binss[i] = bins[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     int max_count = bins[0]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < bin_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         if (bins[i] > max_count) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             max_count = bins[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     if (max_count > 76) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         for (size_t i = 0; i < bin_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             int count = bins[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             size_t height = 76 * (static_cast<double>(count) / max_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             bins[i] = height; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     for (size_t i = 0; i < bin_count; i++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         if (binss[i] < 100) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             cout << " "; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         if (binss[i] < 10) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             cout << " "; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         float t = round((binss[i] / static_cast<double>(number_count)) * 1000) / 10; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         cout << t << "%" << "|"; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         for (size_t j = 0; j < binss[i]; j++) { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |             cout << "*"; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         cout << "\n"; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 |