Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <random>
- #include <algorithm>
- #include <clocale>
- #include <time.h>
- using namespace std;
- int main()
- {
- setlocale(0, "rus");
- int A[100], i, x, M[10], bufer, f, S[10] = { 0 };
- srand(time(0));
- for (i = 0; i < 100; i++) A[i] = rand();
- f = 10;
- x = 0;
- for (i = 0; i < 100; i++)
- {
- if (i < f)
- {
- if (M[x] > A[i]) M[x] = A[i];
- }
- else
- {
- f += 10;
- x++;
- M[x] = A[i];
- }
- }
- for (i = 0; i < 9; i++) //сортировка массива минимумов
- {
- for (x = i + 1; x < 10; x++)
- {
- if (M[i]>M[x])
- {
- bufer = M[i];
- M[i] = M[x];
- M[x] = bufer;
- }
- }
- }
- cout << endl << endl;
- for (i = 0; i < 10; i++)
- {
- cout << M[i] << endl;
- }
- int sum = 0;
- cout << "Среднее значение каждого дестка: ";
- for (i = 0, x = 10; i < 100; i++)
- {
- if (i >= x)
- {
- cout << sum / 10 << endl;
- sum = 0;
- x += 10;
- }
- sum += A[i];
- }
- x = 0;
- i = 0;
- int ser;
- while (i < 100)
- {
- if (A[i + 1] == A[i] + 1) x++;
- else x = 0;
- if (x >= 10) ser++;
- i++;
- }
- cout << "количество серий чисел с шагом 1, состоящих из 10 элементов " << ser << endl;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement