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
| #include <stdio.h>
#include<iostream.h>
#include <conio.h>
void Prosm();
void Del();
void Add();
void Edit();
void Spisok();
int kol =5;
struct koledg
{ int n_aud;
char FIO[15];
int kol_part;
int kol_stul;
int kol_mest;
int remont;
};
struct koledg aud[100]=
{"303","Babenko I.B. ",10,2,20,1,
"302","Kopchik A.P. ",11,3,33,0,
"301","Korobko P.M. ",12,2,24,0,
"304","Dunda S.N. ",10,3,30,1,
"305","Kolos A.S. ",13,2,26,0,
}
void main ()
{ char p_m;
do {
//chrser();
printf("\nGlavnoe menu");
printf("\n1. procmotr fila danux.");
printf("\n2. dobavlenie k fily danux.");
printf("\n3. ydalenie i3 fila danux.");
printf("\n4. redaktirovanie fila danux.");
printf("\n5. vuborka i3 fila danux.");
printf("\n8. BblXOD.");
printf("vuberite punkt");
cin>>p_m;
switch (p_m)
{ case '1':{Prosm(); break;}
case '2':{Add(); break;}
case '3':{Del(); break;}
case '4':{Edit(); break;}
case '5':{Spisok(); break;}
case '8': puts("Vuhod");
}
}
while(p_m!='8');
getch() ;
}
void Prosm()
{
puts("\n procmotr fila danux.");
int i,k;
int n(1);
printf("\n╔═══╦═══════╦═══════════════╦════════╦════════╦════════╦══════╗");
printf("\n║ N ║ n_aud ║ FIO ║kol_part ║kol_stul ║kol_mest ║ remont║");
printf("\n╠═══╬═══════╬═══════════════╬════════╬════════╬════════╬══════╣");
for(i=0;i<=kol-1;i++)
{
printf("\n║%3i║",n);
for(k=0;k<6;k++)
printf("%1c",mas[i].shifr[k]);
printf("║%15s║%20s║%4i║%5i ║ %1i ║%2.2f║", mas[i].n_aud,mas[i].FIO,mas[i].kol_part,mas[i].kol_stul,mas[i].kol_mest,mas[i].remont);
n++;
}
printf("\n╚═══╩═══════╩═══════════════╩════════╩════════╩════════╩══════╝");
getch();
}
void Add()
{ char S[80];
char otv;
int n=0;
cout<<endl<<"kol="<<kol;
printf("\n dobavlenie zapisi");
do{ n++;
puts("\n vvedite n_aud:");
//cin.getline(S,80); //ochistka byfera vvoda
cin>>mas[kol].n_aud;
puts("\n vvedite FIO:");
//cin.get();
cin>>mas[kol].FIO;
puts("\n vvedite kol_part:");
//cin.get();
cin>>mas[kol].kol_part;
puts("\n vvedite kol_mest:");
//cin.getline(S,80);
cin>>mas[kol].kol_mest;
puts("\n vvedite kol_stul:");
//cin.getline(S,80);
cin>>mas[kol].kol_stul;
puts("\n vvedite remont:");
//cin.getline(S,80);
cin>>mas[kol].remont;
puts("\n xotite prodolgut dobavlenie? (n;y)");
cin>>otv;
}
while(otv=='y');
kol=kol+n;
cout<<endl<<"kol="<<kol;
getch();
}
void Del()
{int n,i;
{printf("\n Funkciya udaleniya danuh.");
prosm ();
puts ("\n Vvedite nomer udalyaemoy zapisi:");
while ((skanf("%i",&n))<1);
puts ("\n Neverno! Povtorite vvod nomera:");
if ((n<1)||(n>kol)puts ("\n Takogo nomera net!");
else { for (i=n;kol-1;i++);
{ sot [n-1].n_aud=sot[n].n_aud;
sot [kol].FIO=sot[n].FIO;
sot [n-1].kol_part[n].kol_part;
sot [n-1].kol_stul[n].kol_stul;
sot [n-1].kol_mest[n].kol_mest;
sot [n-1].remont[n].remont;
}
kol--;
printf ("\n Zapis s nomerom =%3; uspeshno udalena.");
}
getch();
}
void Edit()
{puts ("\n Redaktirovanie");
int n,n1;
char p_pm;
if (kol ==0) {puts ("\n Fayl s dnumi pust!");
getch();
}
prosm ();
else { puts ("\n Vedite nomer redaktiruemoy zapisi:");
n1=skanf("%i",&n);
if (n1==0)
{puts ("\n Vveden nevernuy nomer. Povtorite poputku:");
go to metka1;
}
else { if ((n<0)||((n>kol-1)){puts ("\n Vveden nekorektnuy nomer");
getch ();
}
printf ("\n Redaktirovat:\n1.n_aud\n2.FIO\n3.kol_part\n4.kol_stul\n5.kol_mest\n6.remont\n7.Vse\n Vvedite nomer punkta:");
cin << p_pm;
switch (p_pm)
{case '1':{ cin>>mas [kol].n_aud ();
break;
}
case '2': {cin>>mas [kol].FIO ();
break;
}
case '3' : {cin>>mas [kol].kol_part ();
break;
}
case '4' : {cin>>mas [kol].kol_mest ();
break;
}
case '5' : {cin>>mas [kol].kol_stul ();
break;
}
case '6' : {cin>>mas [kol].remont ();
break;
}
default: puts("\n Vveden nevernuy punkt menyu!");
}
}
}
getch();
}
void Spisok()
{puts ("\nvuborka iz fayla danuh.");} |
(
