32 Commits

Author SHA1 Message Date
a5da8d2fee Добавить task5.cpp 2025-09-30 20:38:38 +03:00
e7519dc24f Обновить task4.cpp 2025-09-30 19:53:37 +03:00
9b64e13e2a Удалить tak3.cpp 2025-09-30 19:53:20 +03:00
e3600093fa Удалить tac3.cpp 2025-09-30 19:53:17 +03:00
20c9d088d1 Удалить summa.cpp 2025-09-30 19:53:12 +03:00
6c5500d2ba Удалить sum.cpp 2025-09-30 19:53:08 +03:00
862f587d1d Удалить sum_calculator.cpp 2025-09-30 19:53:05 +03:00
403ca01edc Удалить remove_digits.cpp 2025-09-30 19:53:01 +03:00
9ae89cddcd Удалить rectangle.cpp 2025-09-30 19:52:58 +03:00
a67c2e3a56 Удалить range_checker.cpp 2025-09-30 19:52:53 +03:00
f49c803a60 Удалить profit_analysis.cpp 2025-09-30 19:52:50 +03:00
532733f2a2 Удалить profit_6_months.cpp 2025-09-30 19:52:46 +03:00
7cd1897d42 Удалить print.cpp 2025-09-30 19:52:42 +03:00
af2a1a76dc Удалить network1.sh 2025-09-30 19:52:38 +03:00
32a4d414cc Удалить mult.cpp 2025-09-30 19:52:34 +03:00
0701e8e109 Удалить mergedarray.cpp 2025-09-30 19:52:27 +03:00
91617b3536 Удалить maxElem.cpp 2025-09-30 19:52:23 +03:00
2c79197764 Удалить lucky_number.cpp 2025-09-30 19:52:20 +03:00
be306a74ee Удалить funny_test.cpp 2025-09-30 19:52:16 +03:00
625d037dd8 Удалить find_max.cpp 2025-09-30 19:52:13 +03:00
adce67dbfe Удалить elements.cpp 2025-09-30 19:52:09 +03:00
1b12ecba62 Удалить elem2.cpp 2025-09-30 19:52:02 +03:00
3387f59ead Удалить elem1.cpp 2025-09-30 19:51:58 +03:00
d166bb023e Удалить checer.cpp 2025-09-30 19:51:54 +03:00
e71c544bea Удалить bSearch.cpp 2025-09-30 19:51:50 +03:00
b132eae554 Удалить Arr1-Arr2.cpp 2025-09-30 19:51:46 +03:00
71a5fa7db6 Удалить analysis.cpp 2025-09-30 19:51:42 +03:00
3153e293a7 Удалить 123.cpp 2025-09-30 19:51:32 +03:00
d1c231a13f Удалить task2.cpp 2025-09-30 19:51:27 +03:00
a8309bf572 Добавить task4.cpp 2025-09-30 19:51:02 +03:00
f334a19e74 Удалить FP_HW_03_Цикли.pdf 2025-09-30 15:16:58 +03:00
87c2389c93 Загрузить файлы в «/» 2025-09-30 15:15:48 +03:00
6 changed files with 86 additions and 346 deletions

0
1
View File

View File

@@ -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");
}

View File

@@ -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();
}

View File

@@ -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;
}

34
task4.cpp Normal file
View File

@@ -0,0 +1,34 @@
#include <iostream>
using namespace std;
int* removeNeg(int* a, int n, int& newN) {
int* b = new int[n];
int k = 0;
for (int i = 0; i < n; i++)
if (a[i] >= 0) b[k++] = a[i];
newN = k;
int* c = new int[k];
for (int i = 0; i < k; i++) c[i] = b[i];
delete[] b;
return c;
}
int main() {
srand(time(0));
int n = 10;
int* a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = rand() % 21 - 10;
cout << a[i] << " ";
}
cout << endl;
int newN;
int* b = removeNeg(a, n, newN);
cout << "New array: ";
for (int i = 0; i < newN; i++)
cout << b[i] << " ";
cout << endl;
delete[] a;
delete[] b;
return 0;
}

52
task5.cpp Normal file
View File

@@ -0,0 +1,52 @@
#include <iostream>
using namespace std;
void addBlock(int*& a, int& n, const int* b, int m) {
int* temp = new int[n + m];
for (int i = 0; i < n; i++) {
temp[i] = a[i];
}
for (int i = 0; i < m; i++) {
temp[n + i] = b[i];
}
delete[] a;
a = temp;
n = n + m;
}
int main() {
srand(time(0));
int n = 7, m = 4;
int* a = new int[n];
int* b = new int[m];
cout << "A: ";
for (int i = 0; i < n; i++) {
a[i] = rand() % 30;
cout << a[i] << (i < n - 1 ? " " : "");
}
cout << endl << "B: ";
for (int i = 0; i < m; i++) {
b[i] = rand() % 30;
cout << b[i] << (i < m - 1 ? " " : "");
}
addBlock(a, n, b, m);
cout << endl << "Result: ";
for (int i = 0; i < n; i++) {
cout << a[i] << (i < n - 1 ? " " : "");
}
cout << endl;
delete[] a;
delete[] b;
return 0;
}