|  |  | @ -4,7 +4,8 @@ | 
			
		
	
		
		
			
				
					
					|  |  |  | using namespace std; |  |  |  | using namespace std; | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | void |  |  |  | void | 
			
		
	
		
		
			
				
					
					|  |  |  |     find_minmax(vector<double> numbers, double& min, double& max) { |  |  |  | find_minmax(const vector<double> numbers, double& min, double& max) | 
			
				
				
			
		
	
		
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | { | 
			
		
	
		
		
			
				
					
					|  |  |  |     min = numbers[0]; |  |  |  |     min = numbers[0]; | 
			
		
	
		
		
			
				
					
					|  |  |  |     max = numbers[0]; |  |  |  |     max = numbers[0]; | 
			
		
	
		
		
			
				
					
					|  |  |  |     size_t number_count = numbers.size(); |  |  |  |     size_t number_count = numbers.size(); | 
			
		
	
	
		
		
			
				
					|  |  | @ -22,10 +23,17 @@ using namespace std; | 
			
		
	
		
		
			
				
					
					|  |  |  | } |  |  |  | } | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | 	struct Input { |  |  |  | 
 | 
			
				
				
			
		
	
		
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | struct Input | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | { | 
			
		
	
		
		
			
				
					
					|  |  |  |     vector<double> numbers; |  |  |  |     vector<double> numbers; | 
			
		
	
		
		
			
				
					
					|  |  |  |     size_t bin_count{}; |  |  |  |     size_t bin_count{}; | 
			
		
	
		
		
			
				
					
					|  |  |  | }; |  |  |  | }; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | Input |  |  |  | Input | 
			
		
	
		
		
			
				
					
					|  |  |  | input_data() |  |  |  | input_data() | 
			
		
	
		
		
			
				
					
					|  |  |  | { |  |  |  | { | 
			
		
	
	
		
		
			
				
					|  |  | @ -34,7 +42,8 @@ cin >> number_count; | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |     vector<double> numbers(number_count); |  |  |  |     vector<double> numbers(number_count); | 
			
		
	
		
		
			
				
					
					|  |  |  | for (size_t i = 0; i < number_count; i++) { |  |  |  |     for (size_t i = 0; i < number_count; i++) | 
			
				
				
			
		
	
		
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     { | 
			
		
	
		
		
			
				
					
					|  |  |  |         cin >> numbers[i]; |  |  |  |         cin >> numbers[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |     } |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
	
		
		
			
				
					|  |  | @ -44,7 +53,8 @@ cin >> bin_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |     Input in; |  |  |  |     Input in; | 
			
		
	
		
		
			
				
					
					|  |  |  |     in.numbers.resize(number_count); |  |  |  |     in.numbers.resize(number_count); | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |         for (size_t i = 0; i < number_count; i++) { |  |  |  |     for (size_t i = 0; i < number_count; i++) | 
			
				
				
			
		
	
		
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     { | 
			
		
	
		
		
			
				
					
					|  |  |  |         cin >> in.numbers[i]; |  |  |  |         cin >> in.numbers[i]; | 
			
		
	
		
		
			
				
					
					|  |  |  |     } |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |     cin >> in.bin_count; |  |  |  |     cin >> in.bin_count; | 
			
		
	
	
		
		
			
				
					|  |  | @ -52,9 +62,47 @@ Input in; | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | } |  |  |  | } | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | int main() |  |  |  | 
 | 
			
				
				
			
		
	
		
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | vector<size_t> | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | make_histogram(vector<double> numbers, size_t bin_count) | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     double min, max; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     vector<size_t> bins(bin_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     double bin_size = (max - min) / bin_count; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     find_minmax(numbers, min, max); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     size_t number_count = numbers.size(); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     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]++; | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |         } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | } | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |     Input in = input_data(); |  |  |  |  | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | int main() | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | { | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     auto in = input_data(); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     auto bins = make_histogram(in.numbers, in.bin_count); | 
			
		
	
		
		
			
				
					
					|  |  |  |  |  |  |  |     //show_histogram_text(bins, ...);
 | 
			
		
	
		
		
			
				
					
					|  |  |  | } |  |  |  | } | 
			
		
	
	
		
		
			
				
					|  |  | 
 |