277 lines
4.7 KiB
C
277 lines
4.7 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();
|
|||
|
int findMin();
|
|||
|
int findMorethan10();
|
|||
|
int findLastEven();
|
|||
|
int findIndexMin();
|
|||
|
void deleteElement(int delIndex);
|
|||
|
void insertElement(int insIndex, int value);
|
|||
|
int findFirstEven();
|
|||
|
|
|||
|
void main() {
|
|||
|
SetConsoleCP(1251);
|
|||
|
SetConsoleOutputCP(1251);
|
|||
|
int item;
|
|||
|
do {
|
|||
|
printf("\n");
|
|||
|
printf("------------------------------\n");
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:");
|
|||
|
printElements();
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
|||
|
printf("1: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("2: x10 <20><><EFBFBD> <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("3: <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("4: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 10\n");
|
|||
|
printf("5: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> 2 <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("6: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("7: <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> -1\n");
|
|||
|
printf("8: <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 4 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> 4\n");
|
|||
|
printf("9: <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> 0\n");
|
|||
|
printf("11: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("12: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> i-<2D><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("13: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("14: <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0\n");
|
|||
|
printf("15: <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0\n");
|
|||
|
printf("\n");
|
|||
|
printf("0: <20><><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n");
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> >>>>>> ");
|
|||
|
|
|||
|
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 mon = findMorethan10();
|
|||
|
printf("mon = %d\n", mon);
|
|||
|
break;
|
|||
|
}
|
|||
|
case 5: {
|
|||
|
int index = findLastEven();
|
|||
|
if (index >= 0) {
|
|||
|
arr[index] *= 2;
|
|||
|
}
|
|||
|
}
|
|||
|
break;
|
|||
|
case 6: {
|
|||
|
int index = findIndexMin();
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = %d\n", index);
|
|||
|
|
|||
|
int cnt = 0;
|
|||
|
for (int i = 0; i < index; i++) {
|
|||
|
if (arr[i] % 2 == 0) {
|
|||
|
cnt++;
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n", cnt);
|
|||
|
}
|
|||
|
break;
|
|||
|
|
|||
|
break;
|
|||
|
|
|||
|
|
|||
|
case 7:
|
|||
|
minusodin();
|
|||
|
break;
|
|||
|
|
|||
|
case 11: {
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = ");
|
|||
|
int index;
|
|||
|
scanf_s("%d", &index);
|
|||
|
|
|||
|
deleteElement(index);
|
|||
|
}
|
|||
|
break;
|
|||
|
|
|||
|
case 12: {
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>? <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = ");
|
|||
|
int index;
|
|||
|
scanf_s("%d", &index);
|
|||
|
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = ");
|
|||
|
int value;
|
|||
|
scanf_s("%d", &value);
|
|||
|
|
|||
|
insertElement(index, value);
|
|||
|
}
|
|||
|
break;
|
|||
|
case 13: {
|
|||
|
int min = findMin();
|
|||
|
deleteElement(min);
|
|||
|
}
|
|||
|
break;
|
|||
|
case 14: {
|
|||
|
int indexMin = findIndexMin();
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = %d\n", indexMin);
|
|||
|
|
|||
|
insertElement(indexMin, 0);
|
|||
|
}
|
|||
|
break;
|
|||
|
case 15: {
|
|||
|
int indexChet = findFirstEven();
|
|||
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> = %d\n", indexChet);
|
|||
|
|
|||
|
insertElement(indexChet+1, 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 deleteElement(int delIndex) {
|
|||
|
for (int i = delIndex; i < n - 1; i++) {
|
|||
|
arr[i] = arr[i + 1];
|
|||
|
}
|
|||
|
n--;
|
|||
|
}
|
|||
|
|
|||
|
void insertElement(int insIndex, int value) {
|
|||
|
for (int i = n; i > insIndex; i--) {
|
|||
|
arr[i] = arr[i - 1];
|
|||
|
}
|
|||
|
n++;
|
|||
|
arr[insIndex] = value;
|
|||
|
}
|
|||
|
|
|||
|
|
|||
|
void oddsX10() {
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] % 2 == 1) {
|
|||
|
arr[i] = arr[i] * 10;
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
int findMin() {
|
|||
|
int min = arr[0];
|
|||
|
for (int i = 1; i < n; i++) {
|
|||
|
if (arr[i] < min) {
|
|||
|
min = arr[i];
|
|||
|
}
|
|||
|
}
|
|||
|
return min;
|
|||
|
}
|
|||
|
|
|||
|
void printElements() {
|
|||
|
printf("< ");
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
printf("%d ", arr[i]);
|
|||
|
}
|
|||
|
printf(">\n");
|
|||
|
}
|
|||
|
|
|||
|
int findMorethan10() {
|
|||
|
int mon = 0;
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] > 10) {
|
|||
|
mon += 1;
|
|||
|
}
|
|||
|
}
|
|||
|
return mon;
|
|||
|
}
|
|||
|
|
|||
|
int findLastEven() {
|
|||
|
int chet = 0;
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] % 2 == 0) {
|
|||
|
chet = i;
|
|||
|
}
|
|||
|
}
|
|||
|
return chet;
|
|||
|
}
|
|||
|
|
|||
|
int findFirstEven() {
|
|||
|
int chet = 0;
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] % 2 == 0) {
|
|||
|
chet = i;
|
|||
|
break;
|
|||
|
}
|
|||
|
}
|
|||
|
return chet;
|
|||
|
}
|
|||
|
|
|||
|
int findIndexMin() {
|
|||
|
int min = arr[0];
|
|||
|
for (int i = 1; i < n; i++) {
|
|||
|
if (arr[i] < min) {
|
|||
|
min = arr[i];
|
|||
|
}
|
|||
|
}
|
|||
|
return min;
|
|||
|
}
|
|||
|
|
|||
|
int minusodin() {
|
|||
|
int chet = 0;
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] % 2 == 0) {
|
|||
|
arr[i] = arr[i]*(-1);
|
|||
|
}
|
|||
|
}
|
|||
|
return chet;
|
|||
|
}
|
|||
|
|
|||
|
int chetblre() {
|
|||
|
int chet = 0;
|
|||
|
for (int i = 0; i < n; i++) {
|
|||
|
if (arr[i] < 4) {
|
|||
|
arr[i] = 4;
|
|||
|
}
|
|||
|
}
|
|||
|
return chet;
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
int posleMin() {
|
|||
|
int min = arr[0];
|
|||
|
int inmin = 0;
|
|||
|
for (int i = 1; i < n; i++) {
|
|||
|
if (arr[i] < min) {
|
|||
|
min = arr[i];
|
|||
|
inmin = i;
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
for (int i = 1; i < n; i++) {
|
|||
|
if (i > inmin) {
|
|||
|
arr[i] = 0;
|
|||
|
}
|
|||
|
}
|
|||
|
return min;
|
|||
|
}
|