1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
| #include <stdio.h>
#include <stdlib.h>
#include "stdafx.h"
#include <iostream>
#include <io.h>
#pragma warning(disable : 4996)
using namespace std;
struct zavod {
char name[20];
char kol[20];
char num[20];
string namee;
long long key;
} Record;
FILE *F_Rec, *F_Res;
char File_Rec[] = "record.dat";
char File_Res[] = "result.txt";
void Out(zavod);
void QSort(zavod*, int, int);
void main()
{
setlocale(LC_ALL, "rus");
zavod *mas_Z;
zavod *mas_N;
int size = sizeof(zavod);
int operation;
int status = 0;
int D, amount;
char namee;
int len;
int i, j;
int i_key;
F_Res = fopen(File_Res, "w");
while (true) {
cout << "\n Создать-1\n Добавить-2\n Просмотр-3\n Linear search-4\n Sort by direct choise-5\n Sort by QuickSort-6\n EXIT-0\n";
cin >> operation;
switch (operation) {
case 1:
if ((F_Rec = fopen(File_Rec, "wb")) == NULL) {
cout << "\n Ошибочка!";
return;
}
fclose(F_Rec);
cout << "Create New File " << File_Rec;
break;
case 2:
F_Rec = fopen(File_Rec, "ab");
cout << "\n Имя - ";
cin >> Record.name;
cout << "\n №-Цеха- ";
cin >> Record.num;
cout << "\n Количество - ";
cin >> Record.kol;
Record.key = (Record.kol[6] - '0') * 10000000 + (Record.kol[7] - '0') * 1000000 + (Record.kol[8] - '0') * 100000 + (Record.kol[9] - '0') * 10000 + (Record.kol[3] - '0') * 1000 + (Record.kol[4] - '0') * 100 + (Record.kol[0] - '0') * 10 + (Record.kol[1] - '0');
fwrite(&Record, size, 1, F_Rec);
fclose(F_Rec);
break;
case 3:
if ((F_Rec = fopen(File_Rec, "rb")) == NULL) {
puts("\n Open ERROR!");
return;
}
cout << "\n\t--- Informations ---";
fprintf(F_Res, "\n\t--- Informations ---");
cout << "\n" << "имя" << " " << "кол" << " " << "цех" << " ";
while (1) {
if (!fread(&Record, size, 1, F_Rec)) break;
Out(Record);
}
fclose(F_Rec);
cout << "\n\t--- Informations ---";
break;
case 4:
status = 0;
char kol_keyboard[11];
cout << "Введите количество";
cin >> kol_keyboard;
F_Rec = fopen(File_Rec, "rb");
D = fileno(F_Rec);
len = filelength(D);
amount = len / size;
mas_Z = new zavod[amount];
for (int i = 0; i < amount; i++)
fread((mas_Z + i), size, 1, F_Rec);
fclose(F_Rec);
cout << "\n\t--- RESULT ---\n";
fprintf(F_Res, "\n\t--- RESULT ---\n");
for (int i = 0; i < amount; i++) {
if (strcmp(mas_Z[i].kol, kol_keyboard) == 0) {
status = 1;
Out(mas_Z[i]);
}
}
if (status == 0) cout << "Нет совпадений";
delete[]mas_Z;
break;
case 5:
F_Rec = fopen(File_Rec, "rb");
D = fileno(F_Rec);
len = filelength(D);
amount = len / size;
mas_Z = new zavod[amount];
for (int i = 0; i < amount; i++) {
fread((mas_Z + i), size, 1, F_Rec);
}
fclose(F_Rec);
cout << "\n\t--- RESULT ---\n";
fprintf(F_Res, "\n\t--- RESULT ---\n");
zavod temp;
int m;
for (int i = 0; i < amount - 1; i++) {
m = i;
for (int j = i + 1; j < amount; j++) {
if (mas_Z[j].key > mas_Z[m].key) {
m = j;
}
}
temp = mas_Z[i];
mas_Z[i] = mas_Z[m];
mas_Z[m] = temp;
}
for (int i = 0; i < amount; i++) {
Out(mas_Z[i]);
}
delete[]mas_Z;
break;
case 6:
F_Rec = fopen(File_Rec, "rb");
D = fileno(F_Rec);
len = filelength(D);
amount = len / size;
mas_Z = new zavod[amount];
char name2;
cin >> name2;
for (int i = 0; i < amount; i++) {
fread((mas_Z + i), size, 1, F_Rec);
}
cout << "\n\t--- RESULT ---\n";
fprintf(F_Res, "\n\t--- RESULT ---\n");
QSort(mas_Z, 0, amount - 1);
zavod name;
for (int i = 0; i < amount; i++) {
Out(mas_Z[i]);
}
fclose(F_Rec);
delete[]mas_Z;
break;
case 0:
exit(0);
break;
}
}
}
void Out(zavod z)
{
cout << "\n" << z.name << " " << z.kol << " " << z.num << " ";
fprintf(F_Res, "\n %30s ,%30s, %30s", z.name, z.kol, z.num);
}
void QSort(zavod* a, int left, int right) {
int i = left, j = right;
zavod temp;
unsigned long long p = a[(i + j) / 2].key;
while (i <= j) {
while (a[i].key > p && i<right) i++;
while (a[j].key < p && j>left) j--;
if (i <= j) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
j--;
}
}
if (left < j) QSort(a, left, j);
if (i < right) QSort(a, i, right);
} |
(
