Обновить task3-2.0.cpp

ConsoleApplica44444.cpp

@@ -1,68 +0,0 @@
-#include <iostream>
-#include <fstream>
-using namespace std;
-
-int ncd(int a, int b) {
-    return (b == 0 ? a : ncd(b, a % b));
-}
-
-struct Drib {
-    int ch;
-    int zn;
-
-    void init() {
-        cout << "\nInput ch: ";
-        cin >> ch;
-        cout << "Input zn: ";
-        cin >> zn;
-        skor();
-    }
-    void skor() {
-        int d = ncd(ch, zn);
-        if (d != 0) {
-            ch /= d;
-            zn /= d;
-        }
-        
-    }
-    void print() {
-        cout << ch << "/" << zn << endl;
-    }
-};
-
-int main()
-{
-    Drib a;
-    fstream finOut;
-
-    finOut.open("info.dat", ios::binary | ios::out); //ios::out | ios::trunc);
-    if (!finOut.is_open()) {
-        cerr << "\n Error opening file(out)!!\n";
-        system("pause");
-        return 1;
-    }
-    int vUser;
-    do {
-        a.init();
-
-        finOut.write((char*)(&a), sizeof(Drib));
-        cout << "\n Create a fraction?(1/Yes 0/No) ";
-        cin >> vUser;
-    } while (vUser);
-    finOut.close();
-
-    finOut.open("info.dat", ios::binary | ios::in);
-    if (!finOut.is_open()) {
-        cerr << "\n Beta(in)!!\n";
-        system("pause");
-        return 1;
-    }
-    cout << "\nRead fractions in file:\n";
-    finOut.read((char*)(&a), sizeof(a));
-    while (finOut.good()) {
-        a.print();
-        finOut.read(reinterpret_cast<char*>(&a), sizeof(a));
-    }
-    finOut.close();
-    system("pause");
-}

FractionBinaryFile.cpp

@@ -1,127 +0,0 @@
-#include <iostream>
-#include <fstream>
-using namespace std;
-
-int ncd(int a, int b) {
-	return (b == 0 ? a : ncd(b, a % b));
-}
-
-struct Drib {
-	int ch;
-	int zn;
-
-	void init() {
-		cout << "\nInput ch: ";
-		cin >> ch;
-		cout << "Input zn: ";
-		cin >> zn;
-		skor();
-	}
-	void skor() {
-		int d = ncd(ch, zn);
-		if (d != 0) {
-			ch /= d;
-			zn /= d;
-		}
-	}
-	void print() {
-		cout << ch << "/" << zn << endl;
-	}
-
-};
-int main()
-{
-	Drib a;
-	Drib* pDrip = new Drib;
-	fstream finOut;
-
-	finOut.open("info.dat", ios::binary | ios::out);//ios::out|ios::trunc);
-	if (!finOut.is_open()) {
-		cerr << "\n Error opening file(out)!!\n";
-		system("pause");
-		return 1;
-	}
-	int vUser;
-	do {
-
-		a.init();
-		pDrip->init();
-		finOut.write((char*)pDrip, sizeof(Drib));
-		//finOut.write(reinterpret_cast<char*>(&a), sizeof(a));
-		finOut.write((char*)(&a), sizeof(Drib));
-		cout << "\n Create a fraction?(1/Yes  0/No) ";
-		cin >> vUser;
-	} while (vUser);
-	finOut.close();
-
-	/*ifstream fIn;
-	finOut.open("info.dat", ios::binary );*/
-
-	finOut.open("info.dat", ios::binary | ios::in);
-	if (!finOut.is_open()) {
-		cerr << "\n Beda(in)!!";
-		system("pause");
-		return 1;
-	}
-	cout << "\nRead fractions in file:\n";
-	finOut.read((char*)(&a), sizeof(a));//1 Drip
-	while (finOut.good()) {//!finOut.eof()
-		a.print();
-		finOut.read(reinterpret_cast<char*>(&a), sizeof(a));
-	}
-	finOut.close();
-	system("pause");
-	Drib* p;
-	finOut.open("info.dat", ios::binary | ios::in);
-	if (!finOut.is_open()) {
-		cerr << "\n Error opening file(in)!!";
-		system("pause");
-		return 1;
-	}
-	finOut.seekg(0, ios::end);//ios::beg ios::cur
-	int endpos = (int)finOut.tellg();
-	int n = endpos / sizeof(Drib);
-	cout << "\n There are  " << n << " fractions in the file\n";
-	if (n == 0) {
-		return 0;
-	}
-	finOut.seekg(0);//finOut.seekg(0, ios::beg);
-	p = new Drib[n];
-	int i = 0;
-	for (i = 0; i < n; ++i) {
-		finOut.read(reinterpret_cast<char*>(p + i), sizeof(Drib));
-	}
-
-	cout << "Counted " << i << " fractions\n";
-	for (i = 0; i < n; ++i) {
-		p[i].print();
-
-	}
-
-	//finOut.seekg(sizeof(drob)*(n-1));
-	finOut.seekg(-(streamoff)sizeof(Drib), ios::end);
-	finOut.read(reinterpret_cast<char*>(&a), sizeof(Drib));
-	cout << "\n The last fraction:\n";
-	a.print();
-	delete[] p;
-	finOut.close();
-	a.init();
-	finOut.open("info.dat", ios::binary | ios::app);
-	finOut.write((char*)(&a), sizeof(a));
-	//finOut.seekp(0, ios::end);
-	endpos = (int)finOut.tellp();
-	n = endpos / sizeof(Drib);
-	cout << "\n There are  " << n << " fractions in the file\n";
-	finOut.close();
-	finOut.open("info.dat", ios::binary | ios::in);
-	if (!finOut.is_open()) {
-		cerr << "\n Error: bad open file(in)!!";
-		system("pause");
-		return 1;
-	}
-	finOut.seekg(-(streamoff)sizeof(Drib), ios::end);
-	finOut.read(reinterpret_cast<char*>(&a), sizeof(Drib));
-	cout << "\n The last fraction:\n";
-	a.print();
-}
-

Home_Task1.cpp

@@ -1,151 +0,0 @@
-//#include <iostream>
-//#include <fstream>
-//#define N 7
-//using namespace std;
-//const int sz = 25;
-//struct Marsh {
-//    char nomer[7]
-//    char marshBegin[sz];//<2F><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-//    char marshEnd[sz];//<2F><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-//    int count;//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-//    int tm;//<2F><><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-//    void init();
-//    void show();
-//};
-//
-//int main()
-//{
-//    Marsh marsh;
-//    int vUser;
-//    ofstream fout;
-//    fout.open(".\\Data\\info.dat", ios::binary);
-//    if (!fout.is_open()) {
-//        cerr << "Error: open file(out)\n";
-//        system("pause");
-//        return 1;
-//    }
-//
-//    do {
-//        marsh.init();
-//        fout.write(reinterpret_cast<char*>(&marsh), sizeof(Marsh));
-//    } while (vUser != 0);
-//    fout.close();
-//    ifstream fin;
-//    fin.open(".\\Data\\info.dat", ios::binary);
-//    if (!fin.is_open()) {
-//        cerr << "Error: open file(in)\n";
-//        system("pause");
-//        return 1;
-//    }
-//    fin.seekg(0, ios::end);
-//    int size = (int)fin.tellg();
-//    int n = size/sizeof(M)
-//}
-//void Marsh::init() {
-//    cout << "Input nomer: ";
-//    cin.getline(nomer, N);
-//    cout << "Begin: ";
-//    cin.get(marshBegin, sz);
-//    cout << "End: ";
-//    cin.get(marshEnd, sz);
-//    cout << " count: ";
-//    cin >> tm;
-//    cin.ignore();
-//}
-//void Marsh::show() {
-//    cout << "Nomer: " << nomer
-//        << "\nBegin: " << marshBegin
-//        << "\nEnd: " << marshEnd
-//        << "\n count: " << count + 2
-//        << "\n time: " << fm << endl;
-//}
-//
-
-#include <iostream>
-#include <fstream>
-#define N 7
-using namespace std;
-const int sz = 25;
-
-struct Marsh {
-    char nomer[7];
-    char marshBegin[sz];
-    char marshEnd[sz];
-    int count;
-    int tm;//time
-    void init();
-    void show();
-};
-
-void show(Marsh* p, int n) {
-    for (int i = 0; i < n; ++i)
-        p[i].show();
-}
-
-int main()
-{
-    //".\\resFile\\infoMars.dat"
-   // Marsh marsh;
-    Marsh* pMarsh = new Marsh;
-    int vUser;
-    ofstream fout;
-    fout.open(".\\Data\\info.dat", ios::binary);//ios::out
-    if (!fout.is_open()) {
-        cerr << "Error: open file(out)\n";
-        system("pause");
-        return 1;
-    }
-
-    do {
-        /*marsh.init();
-        fout.write(reinterpret_cast<char*>(&marsh), sizeof(Marsh));*/
-        pMarsh->init();
-        fout.write(reinterpret_cast<char*>(pMarsh), sizeof(Marsh));
-        cout << "Create Marsh?(1(Yes)/0(No) ";
-        cin >> vUser;
-        cin.ignore();
-    } while (vUser != 0);
-    delete pMarsh;
-    fout.close();
-    ifstream fIn;
-    fIn.open(".\\Data\\info.dat", ios::binary);//ios::out
-    if (!fIn.is_open()) {
-        cerr << "Error: open file(out)\n";
-        system("pause");
-        return 1;
-    }
-    fIn.seekg(0, ios::end);
-    int size = (int)fIn.tellg();
-    int n = size / sizeof(Marsh);//n!=0
-    pMarsh = new Marsh[n];
-    fIn.seekg(0);
-    for (int i = 0; i < n; ++i) {
-        fIn.read(reinterpret_cast<char*>(pMarsh + i), sizeof(Marsh));
-    }
-    fIn.close();
-    show(pMarsh, n);
-    delete[] pMarsh;
-    system("pause");
-}
-void Marsh::init() {
-    cout << "Input nomer: ";
-    cin.getline(nomer, N);
-    cout << "Begin: ";
-    cin.getline(marshBegin, sz);
-    cout << "End: ";
-    cin.getline(marshEnd, sz);
-    cout << " count: ";
-    cin >> count;
-    cout << "midle time:  ";
-    cin >> tm;
-    cin.ignore();
-}
-void Marsh::show() {
-    cout << "Nomer: " << nomer
-        << "\nBegin: " << marshBegin
-        << "\n End: " << marshEnd
-        << "\n count: " << count + 2
-        << "\n time: " << tm << endl;
-}
-
-

task1-2.0.cpp

@@ -0,0 +1,67 @@
+#include <iostream>
+
+using namespace std;
+
+void sortArr(int* a, int n) {
+    for (int i = 1; i < n; i++) {
+        int key = a[i];
+        int j = i - 1;
+        while (j >= 0 && a[j] > key) {
+            a[j + 1] = a[j];
+            j--;
+        }
+        a[j + 1] = key;
+    }
+}
+void RemovableLmR(int* a, int& n) {
+    if (n <= 2) {
+        n = 0;
+        return;
+    }
+
+    // Зсуваємо масив вліво, видаляємо перший
+    for (int i = 0; i < n - 1; i++) {
+        a[i] = a[i + 1];
+    }
+
+    // Просто зменшуємо розмір ще на один, прибираємо останній
+    n = n - 2;
+}
+
+void printArr(int* a, int n) {
+    if (n == 0) {
+        cout << "(empty)\n";
+        return;
+    }
+    for (int i = 0; i < n; i++) {
+        cout << a[i] << " ";
+    }
+    cout << "\n";
+}
+
+int main() {
+    srand(time(0));
+    int n;
+    cout << "Enter N: ";
+    cin >> n;
+
+    int* a = new int[n];
+
+    for (int i = 0; i < n; i++) {
+        a[i] = rand() % 101 - 50;
+    }
+
+    cout << "\nOriginal array:\n";
+    printArr(a, n);
+
+    sortArr(a, n);
+    cout << "\nSorted array:\n";
+    printArr(a, n);
+
+    RemovableLmR(a, n);
+    cout << "\nArray after removing first and last:\n";
+    printArr(a, n);
+
+    delete[] a;
+    return 0;
+}

task1.cpp

@@ -0,0 +1,50 @@
+#include <iostream>
+using namespace std;
+
+void sortArr(int* p, int n) {
+    for (int i = 0; i < n - 1; i++) {
+        for (int j = 0; j < n - i - 1; j++) {
+            if (p[j] > p[j + 1]) {
+                int t = p[j];
+                p[j] = p[j + 1];
+                p[j + 1] = t;
+            }
+        }
+    }
+}
+
+void printArr(int* p, int n) {
+    for (int i = 0; i < n; i++) {
+        cout << p[i] << " ";
+    }
+    cout << "\n";
+}
+
+int main() {
+    srand(time(0));
+    int n;
+
+    cout << "Enter N: ";
+    cin >> n;
+
+    int* a = new int[n];
+
+    for (int i = 0; i < n; i++) {
+        a[i] = rand() % 101 - 50;
+    }
+
+    cout << "\nOriginal array:\n";
+    printArr(a, n);
+
+    sortArr(a, n);
+
+    cout << "\nSorted array:\n";
+    printArr(a, n);
+
+    cout << "\nArray without first and last elements:\n";
+    printArr(a + 1, n - 2);
+
+    delete[] a;
+    return 0;
+
+}

task3-2.0.cpp

@@ -0,0 +1,85 @@
+#include <iostream>
+using namespace std;
+
+int* Pos(int* a, int n, int& res_n) {
+    int* tmp = new int[3];
+    res_n = 0;
+    for (int i = 0; i < 3 && i < n; ++i)
+        if (a[i] > 0)
+            tmp[res_n++] = a[i];
+    int* res = new int[res_n];
+    for (int i = 0; i < res_n; ++i) res[i] = tmp[i];
+    delete[] tmp;
+    return res;
+}
+
+int* last3(int* a, int n, int& res_n) {
+    res_n = (n >= 3) ? 3 : n;
+    int* res = new int[res_n];
+    for (int i = 0; i < res_n; ++i)
+        res[i] = a[n - res_n + i];
+    return res;
+}
+
+int* min3(int* a, int n, int& res_n) {
+    int* tmp = new int[n];
+    for (int i = 0; i < n; ++i) tmp[i] = a[i];
+    for (int i = 0; i < n - 1; ++i)
+        for (int j = i + 1; j < n; ++j)
+            if (tmp[i] > tmp[j]) { int t = tmp[i]; tmp[i] = tmp[j]; tmp[j] = t; }
+    res_n = (n >= 3) ? 3 : n;
+    int* res = new int[res_n];
+    for (int i = 0; i < res_n; ++i) res[i] = tmp[i];
+    delete[] tmp;
+    return res;
+}
+
+typedef int* (*searchFunc)(int*, int, int&);
+
+void service(int* a, int n, searchFunc f) {
+    int res_n;
+    int* res = f(a, n, res_n);
+    cout << "Result: ";
+    for (int i = 0; i < res_n; ++i) cout << res[i] << " ";
+    cout << endl;
+    delete[] res;
+}
+
+int main() {
+    srand(time(NULL));
+    int n;
+    cout << "n(n>=3)= ";
+    cin >> n;
+    if (n < 3) {
+        cerr << "Error: size Array!!";
+        return 1;
+    }
+    int* arr = new int[n];
+    for (int i = 0; i < n; ++i)
+        arr[i] = rand() % 41 - 20;
+
+    cout << "Array: ";
+    for (int i = 0; i < n; ++i) cout << arr[i] << " ";
+    cout << endl;
+
+    searchFunc arrFunc[3] = { Pos, last3, min3 };
+
+    int choice;
+    do {
+        cout << "\nMenu:\n"
+            << "1) Array of the first 3 elements > 0\n"
+            << "2) Array of the last 3 elements\n"
+            << "3) Array of the 3 smallest elements\n"
+            << "4) Exit\n"
+            << "Select action (1-4): ";
+        cin >> choice;
+
+        if (choice >= 1 && choice <= 3)
+            service(arr, n, arrFunc[choice - 1]);
+        else if (choice != 4)
+            cout << "Incorrect choice!\n";
+    } while (choice != 4);
+
+    delete[] arr;
+    return 0;
+}

task3.cpp

@@ -0,0 +1,70 @@
+#include <iostream>
+using namespace std;
+
+void Pos(int* a, int n) {
+    int count = 0;
+    for (int i = 0; i < 3 && i < n; ++i)
+        if (a[i] > 0) ++count;
+    cout << "The number of the first 3 elements > 0: " << count << endl;
+}
+
+void Show1(int* a, int n) {
+    cout << "The last 3 elements: ";
+    for (int i = (n >= 3 ? n - 3 : 0); i < n; ++i)
+        cout << a[i] << " ";
+    cout << endl;
+}
+
+void Show2(int* a, int n) {
+    int* b = new int[n];
+    for (int i = 0; i < n; ++i) b[i] = a[i];
+
+    for (int i = 0; i < n-1; ++i)
+        for (int j = i+1; j < n; ++j)
+            if (b[i] > b[j]) { int t = b[i]; b[i] = b[j]; b[j] = t; }
+    cout << "The three smallest elements: ";
+    for (int i = 0; i < 3 && i < n; ++i) cout << b[i] << " ";
+    cout << endl;
+    delete[] b;
+}
+
+typedef void (*searchFunc)(int*, int);
+
+void service(int* a, int n, searchFunc f) {
+    f(a, n);
+}
+
+int main() {
+    srand(time(NULL));
+    int n;
+    cout << "n(n>=3)= ";
+    cin >> n;
+    if (n < 3) {
+        cerr << "Error: size Array!!";
+        return 1;
+    }
+    int* arr = new int[n];
+    for (int i = 0; i < n; ++i)
+        arr[i] = rand() % 41 - 20;
+
+    cout << "Array: ";
+    for (int i = 0; i < n; ++i) cout << arr[i] << " ";
+    cout << endl;
+
+    searchFunc arrFunc[3] = { Pos, Show1, Show2 };
+
+    cout << "Menu:\n"
+         << "1) The number of the first 3 elements > 0\n"
+         << "2) Show the last 3 items\n"
+         << "3) Display the 3 smallest elements\n"
+         << "Select an action (1-3): ";
+    int choice;
+    cin >> choice;
+    if (choice >= 1 && choice <= 3)
+        service(arr, n, arrFunc[choice-1]);
+    else
+        cout << "Incorrect choice!\n";
+
+    delete[] arr;
+    return 0;
+}