1 raspuns

1. 

   Menim Suport

   2020-12-07T22:45:05+02:00Pe 7 decembrie 2020

   Raspuns editat.

   Prima problema:
   https://raw.githubusercontent.com/TCLaurentiu/pbinfo/main/pv1.cpp

   #include <iostream> using namespace std; int main() { int x[] = {9, 4, 3, 8, 5, 1, 6, 2, 7, 10}, n = 10, y[10], min, mpoz; for (int i = 0; i < n; i++) { min = x[i]; mpoz = i; for (int j = i; j < n; j++) if (x[j] < min) { min = x[j]; mpoz = j; } y[i] = mpoz + 1; } for (int i = 0; i < n; i++) cout << y[i] << " "; }

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

   #include <iostream> using namespace std; int main() { int x[] = {9, 4, 3, 8, 5, 1, 6, 2, 7, 10}, n = 10, y[10], min, mpoz;   for (int i = 0; i < n; i++) { min = x[i]; mpoz = i; for (int j = i; j < n; j++) if (x[j] < min) { min = x[j]; mpoz = j; } y[i] = mpoz + 1; }   for (int i = 0; i < n; i++) cout << y[i] << " "; }

   A 2-a problema:
   https://raw.githubusercontent.com/TCLaurentiu/pbinfo/main/pv2.cpp

   #include <iostream> using namespace std; int main() { int n, x[100], p; cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; cin >> p; p--; for (int i = 0; i < n; i++) { if (i < p && 2 * p - i < n) { x[i] += x[2 * p - i]; x[2 * p - i] = 0; } } int max = x[0]; for (int i = 1; i < n; i++) if (x[i] > max) max = x[i]; for (int i = 0; i < n; i++) if (x[i] == max) cout << i + 1 << " "; }

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

   #include <iostream> using namespace std; int main() { int n, x[100], p; cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; cin >> p; p--; for (int i = 0; i < n; i++) { if (i < p && 2 * p - i < n) { x[i] += x[2 * p - i]; x[2 * p - i] = 0; } }   int max = x[0]; for (int i = 1; i < n; i++) if (x[i] > max) max = x[i]; for (int i = 0; i < n; i++) if (x[i] == max) cout << i + 1 << " "; }

   • 0

   • Raspunde