//---------------------------------------------------------------------------

#pragma hdrstop
#include <fstream.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <iomanip.h>
#include <iostream.h>
//---------------------------------------------------------------------------
const char* filename = "dbase";
enum Action {INSERT, DEL, INFO};
enum Dir {LEFT, RIGHT};
const int l_time = 20, l_type = 40, l_number = 12;

struct Fine{
char time[l_time];
char type[l_type];
float price;
Fine* next;
};

struct Node {
char number[l_number];
Fine* beg;
Node* left;
Node* right;
};

struct Data {
char number[l_number];
char time[l_time];
char type[l_type];
float price;
};

Node* descent(Node* p);
Node* first(Data data);
Data input(Action action);
int menu();
void print_node(const Node& node);
void print_dbase(Node* p);
Node* read_dbase(char* filename);
int read_fine(ifstream f, Data& data);
int remove_fine(Node* p,const Data& data);
void remove_fines(Node* p);
Node* remove_node(Node* root, Node* p, Node* parent, Dir dir);
Node* remove_tree(Node* p);
Node* search_insert(Node* root, const Data& data, Action action, Dir& dir, Node*& parent);
void write_dbase(ofstream f,const Node* root);
void write_node(ofstream f, const Node& node);
int main(int argc, char* argv[])
{
Node* p, *parent;
Node* root = read_dbase(filename);
ofstream fout;

Dir dir;
while (true){
switch (menu()){
case 1:
if(!root) root = first(input(INSERT));
else search_insert(root, input(INSERT), INSERT, dir, parent);
break;
case 2:
if(!root){cout << "ÁÀçà ïóñòà" << endl; break;}

Data data = input(DEL);
if (!(p=search_insert(root, data, DEL, dir, parent)))
cout << "Ñâåäåíèÿ îá à/ì îòñóòñòâóþò" << endl;
else
if (remove_fine(p, data) == 2
root = remove_node(root, p, parent, dir);
break;
case 3;
if(!root){ cout << "Áàçà ïóñòà" << endl; break;}

if(!(P =search_insert(root, input(INFO), INFO, dir, parent)))
cout << "Ñâåäåíèÿ îòñóòñòâóþò" << endl;
break;
case 4:
fout.open(filename);
if(!fout.is_open()) {
cout << "Îøèáêà îòêðûòèÿ ôàéëà " << filename << endl; return 1;
}
write_dbase(fout, root);
return 0;

case 5:
print_dbase(root);
break;
default;
cout << "Íàäî ââîñäèòü ÷èñëî îò 1 äî 4"<< endl;
break;
}
}
return 0;
}

Node* descent(Node* p){
Node* prev, *y = p->right;
if(!y->left) y->left = p->left;
else{
do{ prev = y; t=t->left;}
while(y->left);
y->left =p->left;
prev->left = y->right;
y->right = p->right;
}
return y;
}
Node* first(Data data){
Fine* beg = new Fine;
strncpy(beg->time, data.time, l_time);
strncpy(beg->type, data_type, l_type);
beg->price = data.price;
beg->next=0;
Node* root = new Node;
strncpy(root->number, data.number, l_number);
root->beg =beg;
root->left=root->right=0;
}

Data input(Action action){
Data data;
char buf[10], temp[3], temp2[3];
int day, month, hour, min;
cout << "Ââåäèòå íîìåð à/ì" << endl;
cin.getline(data.number, l_number);
if(action == INFO) return data;

do{
cout << "Ââåäèòå äàòó íàðóøåíèÿ â ôîðìàòå ÄÄ.ÌÌ,ÃÃ " <<endl;
cin >>buf;
strncpy(temp1, buf, 2); strncpy(temp2, &buf[3], 2)'
day = atoi(temp1); month = atoi(temp2);
}
while (!(day > 0 & day < 32 && month > 0 && month < 13));

strcpy(data.time, buf); strcat(data.time. " ");

do{
cout << "Ââåäèòå âðåìÿ íàðóøåíèÿ â ôîðìàòå ××:ÌÌ :" << endl;
cin >>buf;
strncpy(temp1, buf, 2); strncpy(temp2, &buf[3], 2)'
hour = atoi(temp1);
min = atoi(temp2);
}
while (!(hour >= 0 && hour < 24 && min >=0 && min < 60 ));

strcat(data.time, buf);
cin.get();
if (action == DEL) return data;

cout << "Ââåäèòå òèï íàðóøåíèÿ type" << endl;
cin.getline(data.type, l_type);

do{cout << "Ââåäèòå ðàçìåðû øòðàôà:" << endl;
cin >> buf;
}
while (!(data.price = (float)atof(buf)));
cin.get();
return data;
}
int menu(){
char buf[10];
int option;
do{
cout << "============================" << endl;
cout << "1 -Ââîä ñâåäåíèé î íàðóøåíèè" << endl;
cout << "2 -Ââîä ñâåäåíèé îá îïëàòå øòðàôà" << endl;
cout << "3-Ñïðàâêà";
cout << "4-Âûõîä" << endl;
cout << "============================" <<endl;

cin >> buf;
option = atoi(buf);}
while(!option);
cin.get();
return option;
}
void print_node(const Node& node){
cout << "Íîìåð à/ì " << node.number << endl;
Fine* pf = node.beg;
float summa = 0;
while (pf){
cout << "Âèä íàðóøåíèÿ " << pf->type << endl;
cout << "Äàòà è âðåìÿ " << pf-time;
cout << " Ðàçìåð øòðàôà " << pf->price <<endl;
}

void print_dbase(Node* p){
if(p){
print_node(*p);
print_dbase(p->left);
print_dbase(p->right);
}
}
Node * read_dbase (char* filename) {
Node * parent;
Dir dir;
Data data;
ifstream f(filename, ios::in| ios::nocreate);
if(!f) {
cout << "Íåò ôàéëà" << filtname << endl; return0;}

f.getline(data.number, l_number);
if(f.eof()) { cout << "Ïóñòîé ôàéë" << endl; return 0;}
read_fine(f, data);
Node* root = first(data);
while (!read_fine(f, data))
search_insert( root, data, INSERT, dir, parent);

while (f, getline(data, number, l_number)){
read_fine(f, data);
search_insert(root, data, INSERT, dit, parent);
}
return root;
}

int read_fine(ifstream f, Data& data){
f.getline(data.time, l_time);
if(data.time[0] == '=') return 1;
f.getline(data.type, l_type);
f->>data.price;
f.get();
return 0;
}

int remove_fine(Node * p, const Data& data){
Fine* prev, *pf = p->beg;
bool found = false;
while (pf && !found){
if(!strcmp(pf->time,data.time))
found = true;
else {
prev = pf;
pf = pf->next;
}
}
if (!found){
cout << "Ñâåäåíèÿ î íàðóøåíèè îòñóòñòâóþò." << endl;
return 1;
}
if(pf == p->beg)
p->beg = pf->next;
else
prev->next = pf->next;
delete pf;
if (!p->beg) return 2;
return 0;
}
Node* remove_node(Node* root, Node* parent, Dir dir){
Node *y;
if (!p->left) y=p->right;
else if (!p->right) y = p->left;
else y=descent(p);
if (dir == LEFT) parent->left = y;
else parent->right = y;
}
delete p;
return root;
}
Node* search_insert(Node* root, const Data& data, Action action, Dir& dir, Node*& parent){
Node* p =root;
bool found = false;
int cmp;
parent = 0;
while (p && !found){
cmp = strcmp(data.number, p->number);
if(!cmp) found = true;
else{
parent = p;
if (cmp < 0) { p=p->left; dir = LEFT;}
else { p = p->right; dir = RIGHT;}
}
}
if (action !=INSERT) return p;

Fine* pf = new Fine;
strncpy(pf->time, data.time, l_time);
strncpy(pf->type, data.type, l_type);
pf->price = data.price;
pf->next =0;

if (!found){
p= new Node;
strncpy(p->number, data.number, l_number);
p->beg = pf;
p->left = p->right = 0;
if(dir == LEFT)
parent->left = p;
else
parent->right =p;
}
else {
Fine* temp = p->beg;
while (temp->next) temp = temp->next;
temp->next= pf;
}
return p;
}
void write_dbase(ofstream f, const Node *p) {
if(p){
write_node(f, *p);
write_dbase( f, p->left);
write_dbase (f, p->right);
}
}
void write_node(ofstream f, const Node& node){
f << node.number << endl;
Fine* pf = node.beg;
while{pf}{
f << pf->time << endl <<pf->type <<endl << pf->price << endl;
pf =pf->next;
}
f<< "=" <<endl;


        return 0;
}
//-------------------------------

  if (k>0)
    *SrAr/=k;

program vtoraia;
const n=10;
var x,t:integer; a,b:array [1..n] of integer;
begin
t:=1;
 for x:=1 to n do
  a[x]:=random (100);
 for x:=1 to n do
   if a[x]<>0 then begin b[t]=a[x]; t:=t+1; end;
 for x:=1 to t do
  writeln (b[x],' ');
  readln
end.