Удалить 123.cpp

2025-09-30 15:17:09 +03:00
parent 09d2d9df68
commit 6d87e57c90
1 changed files with 0 additions and 392 deletions
--- a/123.cpp
+++ b/123.cpp
@@ -1,392 +0,0 @@
-//
-//#include <iostream>
-//#include <time.h>
-//#define N 5
-//const int m = 7;
-//using namespace std;
-//
-///*
-//type_or_void name_func(void_or_ type name1, type name2,..., type1 nameN=value){
-////body
-//return value;
-//}
-//
-//*/
-//
-//double suma(int n = 7) {
-//    double x;
-//    double suma = 0;
-//    for (; n > 0; --n) {
-//        cout << "Input number: ";
-//        cin >> x;
-//        suma += x;
-//    }
-//    return suma;
-//}
-//
-//
-//double sumRec(int n, double arr[]) {//sum(n)=x+sum(n-1)
-//    if (n == 0) return 0;
-//    // double x;
-//    cout << "Input number: ";
-//    cin >> arr[n - 1];
-//    return arr[n - 1] + sumRec(n - 1, arr);
-//}
-//
-//double sumRecNew(int n, double arr[], double s = 0, int i = 0) {
-//    if (i == n) return s;
-//    // double x;
-//    cout << "Input number: ";
-//    cin >> arr[i];
-//    return sumRecNew(n, arr, s + arr[i], i + 1);
-//}
-//
-//
-//
-//
-//
-//double suma(double a[], int n) {
-//    double sum = 0;
-//    for (int i = n - 1; i >= 0; --i)
-//        sum += a[i];
-//    return sum;
-//}
-//
-//
-//void updateElement(double a[], int n) {
-//    for (int i = n / 2; i < n; ++i) {
-//        a[i] += a[0];
-//    }
-//}
-//
-//void showArray(double a[], int n) {
-//    if (n < 2) return;
-//    for (int i = 0; i < n; ++i) {
-//        cout.width(4);
-//        cout << a[i];
-//    }
-//    cout << endl;
-//    return;
-//}
-//
-//void showArray(int a[][m], int n) {
-//
-//    for (int i = 0; i < n; ++i) {
-//        for (int j = 0; j < m; ++j) {
-//            cout.width(4);
-//            cout << a[i][j];
-//        }
-//        cout << endl;
-//    }
-//
-//}
-//
-//void updateArray(int a[][m], int index) {
-//    for (int i = 0; i < m; ++i) {
-//        a[index][i] *= -1;
-//    }
-//}
-//
-//
-//
-//int main()
-//{
-//    srand(time(NULL));
-//    const int n = 5;
-//    double a[5]{ 0 };
-//    /*  cout << "Input n: ";
-//      cin >> n;*/
-//    double s = sumRec(n, a);
-//    cout << "\nArray1:\n";
-//    showArray(a, n);
-//    cout << "S= " << s << endl;
-//
-//    s = sumRecNew(n, a);
-//    cout << "\nArray1:\n";
-//    showArray(a, n);
-//    cout << "S= " << s << endl;
-//
-//
-//
-//
-//    //const int n = 10;
-//    //double sum;// = suma(10);
-//    //cout << "sum(10) = \n" << sum
-//    //    << "\nsum(7) = " << suma();
-//    //cout << "\n n(n>0)= ";
-//   // int n;
-//    //cin >> n;
-//    //if (n <= 0) {
-//    //    cerr << "Error: " << n << " < 0 !!!!\n n= "<<-n<<endl;
-//    //    n = -n;
-//    //}
-//    //sum = suma(n);
-//    //cout << "\nsum(" << n << ") = " << sum << endl;
-//
-//   // double arr[n] = { -4,6,3,7,89,2,3,5,6 };
-//   // cout << "\n Array:\n";
-//   // showArray(arr, n);
-//   // sum = suma(arr,n);
-//   // cout << "\nArray sum(" << n << ") = " << sum << endl;
-//   // cout << "\n Array:\n";
-//   // showArray(arr, n/2);
-//   // sum = suma(arr, n/2);
-//   // cout << "\nArray sum(" << n/2 << ") = " << sum << endl;
-//
-//   // cout << "\n Array:\n";
-//   // showArray(arr+2, n / 2);
-//   //sum = suma(arr+2, n / 2);
-//   // cout << "\nArray sum(" << n / 2 << ") = " << sum << endl;
-//
-//   // cout << "\n Array:\n";
-//   // showArray(arr, n);
-//   // updateElement(arr, n);
-//   // cout << "\n New Array:\n";
-//   // showArray(arr, n);
-//
-// /*   int arr[N][m]{ 0 };
-//    for (int i = 0; i < N; ++i)
-//        for (int j = 0; j < m; ++j)
-//            arr[i][j] = rand() % 100;
-//    cout << "\n Array:\n";
-//    showArray(arr, N);
-//    int index;
-//    cout << "0<= index < " << N - 1 << " ? ";
-//    cin >> index;
-//    if (index < 0 || index >= N) {
-//        index = N / 2;
-//    }
-//    updateArray(arr, index);
-//    cout << "\n  new Array:\n";
-//    showArray(arr, N);*/
-//    system("pause");
-//}
-//
-//
-//
-//
-//
-//#include <iostream>
-//using namespace std;
-//
-//void print(int n) {
-//    if (n == 0) {
-//        return;
-//    }
-//    cout << "*";
-//    print(n - 1);
-//}
-//
-//int main() {
-//    setlocale(0, "");
-//    int n;
-//    cout << "<22><><EFBFBD><EFBFBD>i<EFBFBD><69> <20>i<EFBFBD><69><EFBFBD>i<EFBFBD><69><EFBFBD> <20>i<EFBFBD><69><EFBFBD>: ";
-//    cin >> n;
-//
-//    print(n);
-//    cout << endl;
-//
-//    system("pause");
-//}
-
-
-//#include <iostream>
-//using namespace std;
-//
-//int sum(int a, int b) {
-//    if (a > b) { 
-//        return 0;
-//    }
-//    return a + sum(a + 1, b);
-//}
-//
-//int main() {
-//    setlocale(0, "");
-//    int a;
-//    int b;
-//    cout << "<22><><EFBFBD><EFBFBD>i<EFBFBD><69> a: ";
-//    cin >> a;
-//    cout << "<22><><EFBFBD><EFBFBD>i<EFBFBD><69> b: ";
-//    cin >> b;
-//
-//    cout << "<22><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20>i<EFBFBD> " << a << " <20><> " << b << " = " << sum(a, b) << endl;
-//
-//    return 0;
-//}
-
-//#include <iostream>
-//#include <time.h>
-//#define N 5
-//#define B 5
-//using namespace std;
-//
-//int maxElem(int x, int y) {
-//	int max = (x > y) ? x : y;
-//	return max;
-//}
-//
-//int maxElem(int x, int y, int z) {
-//	int max = (x > y) ? x : y;  
-//	max = (max > z) ? max : z;  
-//	return max;
-//}
-//
-//int maxElem(int a[], int n) {
-//	int max = a[0];
-//	for (int i = 1; i < n; i++) {
-//		if (a[i] > max) {
-//			max = a[i];  
-//		}
-//	}
-//	return max;
-//}
-//
-//int maxElem(int a[][N], int n) {
-//	int max = a[0][0];
-//	for (int i = 0; i < n; i++) {
-//		for (int j = 0; j < N; j++) {
-//			if (a[i][j] > max) {
-//				max = a[i][j];
-//			}
-//		}
-//	}
-//	return max;
-//}
-//
-//int maxElem(int a[][N][B], int n) {
-//	int max = a[0][0][0];
-//	for (int i = 0; i < n; i++) {
-//		for (int j = 0; j < N; j++) {
-//			for (int k = 0; k < B; k++) {
-//				if (a[i][j][k] > max) {
-//					max = a[i][j][k];
-//				}
-//			}
-//		}
-//	}
-//	return max;
-//}
-//
-//int main() {
-//    srand(time(0));
-//    setlocale(0, "");
-//
-//    int x = rand() % 100;
-//    int y = rand() % 100;
-//    int z = rand() % 100;
-//    cout << "<22><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>: x = " << x << ", y = " << y << ", z = " << z << endl;
-//    cout << "max(2): " << maxElem(x, y) << endl;
-//    cout << "max(3): " << maxElem(x, y, z) << endl << endl;
-//
-//    int arr1[5];
-//    cout << "<22><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: ";
-//    for (int i = 0; i < 5; i++) {
-//        arr1[i] = rand() % 100;
-//        cout << arr1[i] << " ";
-//    }
-//    cout << "\nmax(1D): " << maxElem(arr1, 5) << endl << endl;
-//
-//    int arr2[2][N];
-//    cout << "<22><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n";
-//    for (int i = 0; i < 2; i++) {
-//        for (int j = 0; j < N; j++) {
-//            arr2[i][j] = rand() % 100;
-//            cout << arr2[i][j] << "\t";
-//        }
-//        cout << endl;
-//    }
-//    cout << "max(2D): " << maxElem(arr2, 2) << endl << endl;
-//
-//    int arr3[2][N][B];
-//    cout << "<22><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n";
-//    for (int i = 0; i < 2; i++) {
-//        cout << "<22><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " << i << ":\n";
-//        for (int j = 0; j < N; j++) {
-//            for (int k = 0; k < B; k++) {
-//                arr3[i][j][k] = rand() % 100;
-//                cout << arr3[i][j][k] << "\t";
-//            }
-//            cout << endl;
-//        }
-//        cout << endl;
-//    }
-//    cout << "max(3D): " << maxElem(arr3, 2) << endl;
-//
-//    return 0;
-//}
-
-
-#include <iostream>
-#include <ctime>
-using namespace std;
-
-void bSort(int arr[], int size) {
-    for (int i = 0; i < size - 1; ++i) {
-        for (int j = 0; j < size - i - 1; ++j) {
-            if (arr[j] > arr[j + 1]) {
-                int temp = arr[j];
-                arr[j] = arr[j + 1];
-                arr[j + 1] = temp;
-            }
-        }
-    }
-}
-
-int bSearch(int arr[], int size, int target) {
-    int low = 0;
-    int high = size - 1;
-
-    while (low <= high) {
-        int m = low + (high - low) / 2;
-
-        if (arr[m] == target) {
-            return m;
-        }
-        if (arr[m] < target) {
-            low = m + 1;
-        }
-        else {
-            high = m - 1;
-        }
-    }
-
-    return -1;
-}
-
-int main() {
-    srand(time(0));
-    setlocale(0, "");
-
-    const int size = 10;
-    int arr[size];
-
-    cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>: ";
-    for (int i = 0; i < size; ++i) {
-        arr[i] = rand() % 300 + 1;
-        cout << arr[i] << " ";
-    }
-    cout << endl;
-
-    bSort(arr, size);
-
-    cout << "<EFBFBD>i<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>: ";
-    for (int i = 0; i < size; ++i) {
-        cout << arr[i] << " ";
-    }
-    cout << endl;
-
-    int t;
-    cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: ";
-    cin >> t;
-
-    int index = bSearch(arr, size, t);
-
-    if (index != -1) {
-        cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> i<><69><EFBFBD><EFBFBD><EFBFBD>i (<28> <20>i<EFBFBD><69><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>i): " << index << endl;
-    }
-    else {
-        cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>." << endl;
-    }
-
-    return 0;
-}