fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. 	int n;
  6. 	cin >> n;
  7. 	int x[n];
  8. 	int counter = 0; // количество перемещений
  9. 	for (int i = 0; i < n; i++){
  10. 		cin >> x[i];
  11. 	}
  12. 	int first = x[0]; // первый по порядку элемент
  13. 	for (int i = 0; i < n - 1; i++) {
  14. 		int min = i; // индекс минимального элемента
  15. 		for (int j = i + 1; j < n; j++) {
  16. 			if (x[j] < x[min]) min = j;
  17. 		}
  18. 		if((x[i] == first || x[min] == first) && x[i] != x[min]) counter++;
  19. 		swap(x[i], x[min]);
  20. 	}
  21. 	cout << counter;
  22. 	return 0;
  23. }
Success #stdin #stdout 0s 4364KB
comments (?)
stdin
copy 
7
15 1 6 3 9 8 13
stdout
copy 
4
https://ideone.com/uBuuBu
Метод минимума
language:
C++ (gcc 8.3)
created:
4 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!