Advertisement
JmihPodvalbniy

Untitled

Nov 30th, 2024
13
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.24 KB | Software | 0 0
  1. Дз от 20.11.2024г.
  2.  
  3. 1)
  4. #include <iostream>
  5. #include <vector>
  6. #include <algorithm>
  7.  
  8. using namespace std;
  9.  
  10. int main() {
  11.     int size;
  12.     cin >> size;
  13.     vector<int> arr(size);
  14.     for (int i = 0; i < size; ++i) cin >> arr[i];
  15.     int num;
  16.     cin >> num;
  17.     if (find(arr.begin(), arr.end(), num) != arr.end())
  18.         cout << "Число найдено!" << endl;
  19.     else
  20.         cout << "Число не найдено!" << endl;
  21.     return 0;
  22. }
  23.  
  24. 2)
  25. #include <iostream>
  26. #include <vector>
  27. #include <limits>
  28.  
  29. using namespace std;
  30.  
  31. int main() {
  32.     int size;
  33.     cin >> size;
  34.     vector<int> arr(size);
  35.     for (int i = 0; i < size; ++i) cin >> arr[i];
  36.     int minVal = numeric_limits<int>::max();
  37.     int maxVal = numeric_limits<int>::min();
  38.     for (int x : arr) {
  39.         if (x < minVal) minVal = x;
  40.         if (x > maxVal) maxVal = x;
  41.     }
  42.     cout << "Min: " << minVal << ", Max: " << maxVal << endl;
  43.     return 0;
  44. }
  45.  
  46. 3)
  47. #include <iostream>
  48. #include <vector>
  49. #include <algorithm>
  50.  
  51. using namespace std;
  52.  
  53. int main() {
  54.     int size;
  55.     cin >> size;
  56.     vector<int> arr(size);
  57.     for (int i = 0; i < size; ++i) cin >> arr[i];
  58.     int numToRemove;
  59.     cin >> numToRemove;
  60.     arr.erase(remove(arr.begin(), arr.end(), numToRemove), arr.end());
  61.     for (int x : arr) cout << x << " ";
  62.     cout << endl;
  63.     return 0;
  64. }
  65.  
  66. 4)
  67. #include <iostream>
  68. #include <vector>
  69.  
  70. using namespace std;
  71.  
  72. int main() {
  73.     int size1, size2;
  74.     cin >> size1 >> size2;
  75.     vector<int> arr1(size1), arr2(size2);
  76.     for (int i = 0; i < size1; ++i) cin >> arr1[i];
  77.     for (int i = 0; i < size2; ++i) cin >> arr2[i];
  78.     vector<int> result = arr1;
  79.     result.insert(result.end(), arr2.begin(), arr2.end());
  80.     for (int x : result) cout << x << " ";
  81.     cout << endl;
  82.     return 0;
  83. }
  84.  
  85. 5)
  86. #include <iostream>
  87. #include <vector>
  88.  
  89. using namespace std;
  90.  
  91. int main() {
  92.     int size;
  93.     cin >> size;
  94.     vector<int> arr(size);
  95.     for (int i = 0; i < size; ++i) cin >> arr[i];
  96.     for (int i = 0; i < size - 1; ++i) {
  97.         for (int j = 0; j < size - i - 1; ++j) {
  98.             if (arr[j] > arr[j + 1]) swap(arr[j], arr[j + 1]);
  99.         }
  100.     }
  101.     for (int x : arr) cout << x << " ";
  102.     cout << endl;
  103.     return 0;
  104. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement