{"draftJsState":{"blocks":[{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"Создадим код на С++ в котором создадим массив случайных чисел. И будем находить сумму отрицательных элементов и наибольший элемент, а затем выведем массив и результаты на экран. Вот сам код:","type":"unstyled","key":"8u1qs"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"#include ","type":"blockquote","key":"3c2gl"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"#include ","type":"blockquote","key":"12f9c"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"#include ","type":"blockquote","key":"3hlq2"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"using namespace std;","type":"blockquote","key":"8jgc1"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"int main() {","type":"blockquote","key":"8aeuq"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" const int size = 10; // Размер массива","type":"blockquote","key":"apvg1"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" int arr[size]; // Объявление массива","type":"blockquote","key":"4a59a"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"// Заполнение массива случайными числами","type":"blockquote","key":"d91qs"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" srand(time(0)); // Инициализация генератора случайных чисел","type":"blockquote","key":"8t8l4"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" for (int i = 0; i < size; i++) {","type":"blockquote","key":"au145"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" arr[i] = rand() % 100 - 50; // Генерация чисел от -50 до 49","type":"blockquote","key":"it50"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" }","type":"blockquote","key":"25p63"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"// Нахождение суммы отрицательных элементов и наибольшего элемента","type":"blockquote","key":"2oe5c"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" int sumOfNegatives = 0;","type":"blockquote","key":"1gaoa"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" int largestElement = arr[0];","type":"blockquote","key":"43tfe"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" for (int i = 0; i < size; i++) {","type":"blockquote","key":"ch6mb"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" if (arr[i] < 0) {","type":"blockquote","key":"ejsjq"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" sumOfNegatives += arr[i];","type":"blockquote","key":"c6mnd"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" }","type":"blockquote","key":"6q9ug"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" if (arr[i] > largestElement) {","type":"blockquote","key":"651kl"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" largestElement = arr[i];","type":"blockquote","key":"6hasa"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" }","type":"blockquote","key":"1070a"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" }","type":"blockquote","key":"65oc"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"// Вывод результатов","type":"blockquote","key":"ar3sv"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" cout << \"Массив: \";","type":"blockquote","key":"b45bc"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" for (int i = 0; i < size; i++) {","type":"blockquote","key":"48jc0"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" cout << arr[i] << \" \";","type":"blockquote","key":"3kv2v"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" }","type":"blockquote","key":"bd34h"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" cout << endl;","type":"blockquote","key":"e1a9k"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" cout << \"Сумма отрицательных элементов: \" << sumOfNegatives << endl;","type":"blockquote","key":"dhqnt"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" cout << \"Наибольший элемент: \" << largestElement << endl;","type":"blockquote","key":"a4crh"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":" return 0;","type":"blockquote","key":"bcacj"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"}","type":"blockquote","key":"drt9v"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[{"length":4,"offset":33,"style":"BOLD"}],"text":"Создается массив из 10 элементов arr.","type":"ordered-list-item","key":"e8goq"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[{"length":20,"offset":113,"style":"BOLD"}],"text":"Массив назначается случайными числами от -50 до 49 с помощью функции и инициализации генератора случайных чисел .rand()srand(time(0))","type":"ordered-list-item","key":"8povq"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"В цикле вычисляются низкие отрицательные элементы и самый большой элемент массива.","type":"ordered-list-item","key":"eeu4t"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"Результаты, полученные на экране, включая сам массив, содержат отрицательные элементы и самый большой элемент.","type":"ordered-list-item","key":"1p93a"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"Этот код включает в себя работу с массивами, генерацию случайных чисел, а также нахождение количества отрицательных элементов и наибольшего элемента в массиве.","type":"unstyled","key":"djqt"},{"data":{},"depth":0,"entityRanges":[],"inlineStyleRanges":[],"text":"","type":"marker","key":"JsbYrVcnqjt6oJEHO5Ps"}],"entityMap":{}},"mentions":[]}