290 lines
6.5 KiB
C++
290 lines
6.5 KiB
C++
#include <stdio.h>
|
|
#include <Windows.h>
|
|
|
|
#define NUM_ELEMENTS 10
|
|
|
|
int arr[NUM_ELEMENTS];
|
|
int n = 0;
|
|
|
|
void printElements();
|
|
void keyboardInput();
|
|
void oddsX10();
|
|
void oddsX_1();
|
|
void deleteElement(int delIndex);
|
|
int findMin();
|
|
void Menshe4();
|
|
int countElements();
|
|
int findLastEven();
|
|
int findLastEven4();
|
|
int findIndexMin();
|
|
int findIndexMax();
|
|
void insertElement(int insIndex, int value);
|
|
void insertElement4(int insIndex, int value);
|
|
|
|
void main() {
|
|
SetConsoleCP(1251);
|
|
SetConsoleOutputCP(1251);
|
|
int item;
|
|
do {
|
|
printf("\n");
|
|
printf("------------------------------\n");
|
|
printf("Ñîäåðæèìîå ìàññèâà:");
|
|
printElements();
|
|
printf("Âûáåðèòå íóæíóþ âàì îïåðàöèþ:\n");
|
|
printf("1: Ââåñòè ñ êëàâèàòóðû ìàññèâ\n");
|
|
printf("2: x10 äëÿ âñåõ í¸÷åòíûõ ýëåìåíòîâ\n");
|
|
printf("3: Íàéòè ìèíèìàëüíûé ýëåìåíò\n");
|
|
printf("4: Ñêîëüêî ýëåìåíòîâ > 10\n");
|
|
printf("5: x2 äëÿ ïîñëåäíåãî ÷åòíîãî\n");
|
|
printf("6: Ñêîëüêî ÷¸òíûõ ëåâåå ìèíèìàëüíîãî\n");
|
|
printf("7: õ10 äëÿ íå÷¸òíûõ ïðàâåå ìèíèìàëüíîãî\n");
|
|
printf("8: ïåðåñòàíîâêà ìàêñèìàëüíîãî è ìèíèìàëüíîãî ýëåìåíòà\n");
|
|
printf("9: âñå ÷åòíûå ýëåìåíòû ìàññèâà óìíîæèòü íà -1\n");
|
|
printf("10: Âñå ýëåìåíòû ìàññèâà èìåþùèå çíà÷åíèÿ ìåíüøå 4 çàìåíèòü íà 4\n");
|
|
printf("11: Bñå ÷åòíûå ýëåìåíòû, ñòîÿùèå ëåâåå ìèíèìàëüíîãî, çàìåíèòü íà 0\n");
|
|
printf("12: Óäàëèòü çàäàííûé ýëåìåíò\n");
|
|
printf("13: Âñòàâèòü íîâûé ýëåìåíò â çàäàííîå ìåñòî\n");
|
|
printf("14: Óäàëèòü ìèíèìàëüíûé ýëåìåíò\n");
|
|
printf("15: Ïåðåä ìèíèìàëüíûì ýëåìåíòîì âñòàâèòü 0\n");
|
|
printf("16: Ïîñëå ïîñëåäíåãî êðàòíîãî ÷åòûðåì ýëåìåíòà âñòàâèòü 0\n");
|
|
printf("\n");
|
|
printf("0: Âûéòè èç ïðîãðàììû\n");
|
|
printf("Âûáðàííàÿ îïåðàöèÿ >>>>>> ");
|
|
|
|
scanf_s("%d", &item);
|
|
|
|
switch (item) {
|
|
case 1:
|
|
keyboardInput();
|
|
break;
|
|
|
|
case 2:
|
|
oddsX10();
|
|
break;
|
|
|
|
case 3:
|
|
{
|
|
int min = findMin();
|
|
printf("min = %d\n", min);
|
|
}
|
|
break;
|
|
case 4:
|
|
{
|
|
int cnt = countElements();
|
|
printf(" %d ýëåìåíòîâ > 10\n", cnt);
|
|
|
|
}
|
|
break;
|
|
case 5:
|
|
{
|
|
int index = findLastEven();
|
|
if (index >= 0) {
|
|
arr[index] *= 2;
|
|
}
|
|
}
|
|
break;
|
|
case 6:
|
|
{
|
|
int index = findIndexMin();
|
|
printf("Èíäåêñ ìèíèìàëüíîãî ýëåìåíòà = %d\n", index);
|
|
|
|
int cnt = 0;
|
|
for (int i = 0; i < index; i++) {
|
|
if (arr[i] % 2 == 0) {
|
|
cnt++;
|
|
}
|
|
}
|
|
printf("Ëåâåå ìèíèìàëüíîãî %d ÷åòíûõ ýëåìåíòîâ\n", cnt);
|
|
}
|
|
case 7:
|
|
{
|
|
int index = findIndexMin();
|
|
printf("Èíäåêñ ìèíèìàëüíîãî ýëåìåíòà = %d\n", index);
|
|
|
|
int cnt = 0;
|
|
for (int i = index - 1; i < n; i++) {
|
|
if (arr[i] % 2 == 1) {
|
|
arr[i] *= 10;
|
|
}
|
|
}
|
|
|
|
}
|
|
break;
|
|
case 8:
|
|
{
|
|
int indexMin = findIndexMin();
|
|
printf("Èíäåêñ ìèíèìàëüíîãî ýëåìåíòà = %d\n", indexMin);
|
|
int indexMax = findIndexMax();
|
|
printf("Èíäåêñ ìàêñèìàëüíîãî ýëåìåíòà = %d\n", indexMax);
|
|
|
|
int tmp = arr[indexMin];
|
|
arr[indexMin] = arr[indexMax];
|
|
arr[indexMax] = tmp;
|
|
}
|
|
case 9:
|
|
oddsX_1();
|
|
break;
|
|
case 10:
|
|
Menshe4();
|
|
break;
|
|
|
|
case 11:
|
|
{
|
|
int index = findIndexMin();
|
|
printf("Èíäåêñ ìèíèìàëüíîãî ýëåìåíòà = %d\n", index);
|
|
|
|
for (int i = 0; i < index; i++) {
|
|
if (arr[i] % 2 == 0) {
|
|
arr[i] = 0;
|
|
}
|
|
}
|
|
}break;
|
|
|
|
case 12:
|
|
{
|
|
printf("Èíäåêñ óäàëÿåìîãî ýëåìåíòà = ");
|
|
int index;
|
|
scanf_s("%d", &index);
|
|
|
|
deleteElement(index);
|
|
|
|
}
|
|
break;
|
|
case 13:
|
|
{
|
|
printf("Ïåðåä êàêèì ýëåìåíòîì íóæíî âñòàâèòü íîâûé? Èíäåêñ = ");
|
|
int index;
|
|
scanf_s("%d", &index);
|
|
|
|
printf("Çíà÷åíèå, êîòîðîå íóæíî âñòàâèòü = ");
|
|
int value;
|
|
scanf_s("%d", &value);
|
|
|
|
insertElement(index, value);
|
|
}
|
|
break;
|
|
case 14:
|
|
{
|
|
int min = findIndexMin();
|
|
deleteElement(min);
|
|
}
|
|
break;
|
|
case 15:
|
|
{
|
|
int indexMin = findIndexMin();
|
|
printf("Èíäåêñ ìèíèìàëüíîãî ýëåìåíòà = %d\n", indexMin);
|
|
|
|
insertElement(indexMin, 0);
|
|
}
|
|
break;
|
|
case 16:
|
|
{
|
|
int Krat = findLastEven4();
|
|
|
|
insertElement4(Krat, 0);
|
|
}
|
|
break;
|
|
|
|
}
|
|
|
|
} while (item != 0);
|
|
}
|
|
|
|
void keyboardInput() {
|
|
printf("n = ");
|
|
scanf_s("%d", &n);
|
|
|
|
printf("input %d values: ", n);
|
|
for (int i = 0; i < n; i++) {
|
|
scanf_s("%d", &arr[i]);
|
|
}
|
|
}
|
|
|
|
void oddsX10() {
|
|
for (int i = 0; i < n; i++) {
|
|
if (arr[i] % 2 == 1) {
|
|
arr[i] = arr[i] * 10;
|
|
}
|
|
}
|
|
}
|
|
|
|
void printElements() {
|
|
printf("< ");
|
|
for (int i = 0; i < n;i++ ) {
|
|
printf("%d ", arr[i]);
|
|
}
|
|
printf(">\n");
|
|
}
|
|
|
|
|
|
int findMin() {
|
|
int min = arr[0];
|
|
for (int i = 1; i < n; i++) {
|
|
if (arr[i] < min) {
|
|
min = arr[i];
|
|
}
|
|
}
|
|
return min;
|
|
}
|
|
|
|
int countElements() {
|
|
int cnt = 0;
|
|
for (int i = 0; i < n; i++) {
|
|
if (arr[i] > 10) {
|
|
cnt++;
|
|
}
|
|
}
|
|
return cnt;
|
|
}
|
|
|
|
int findLastEven() {
|
|
for (int i = n - 1; i >= 0; i--)
|
|
{
|
|
if (arr[i] % 2 == 0) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
int findIndexMin() {
|
|
int min = arr[0];
|
|
int indexMin = 0;
|
|
for (int i = 1; i < n; i++) {
|
|
if (arr[i] < min) {
|
|
min = arr[i];
|
|
indexMin = i;
|
|
}
|
|
}
|
|
return indexMin;
|
|
}
|
|
|
|
int findIndexMax() {
|
|
int max = arr[0];
|
|
int indexMax = 0;
|
|
for (int i = 1; i < n; i++) {
|
|
if (arr[i] > max) {
|
|
max = arr[i];
|
|
indexMax = i;
|
|
}
|
|
}
|
|
return indexMax;
|
|
}
|
|
void oddsX_1() {
|
|
for (int i = 0; i < n; i++) {
|
|
if (arr[i] % 2 == 0) {
|
|
arr[i] = arr[i] * -1;
|
|
}
|
|
}
|
|
}
|
|
void Menshe4() {
|
|
for (int i = 0; i < n; i++) {
|
|
if (arr[i] < 4) {
|
|
arr[i] = 4;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|