2

67 56 57 38 46
60 57 34 37 34
10 20 43 68 35
88 90 71 36 32
flowers\D.W. Mn Tu Wn Th Fr
chamomiles
roses
carnations
peonies

             Selling
********************************************
*flowers\D.W.*  Mn *  Tu *  Wn *  Th *  Fr *
********************************************
*chamomiles  *  67 *  56 *  57 *  38 *  46 *
********************************************
*roses       *  60 *  57 *  34 *  37 *  34 *
********************************************
*carnations  *  10 *  20 *  43 *  68 *  35 *
********************************************
*peonies     *  88 *  90 *  71 *  36 *  32 *
********************************************
*total       * 225 * 223 * 205 * 179 * 147 *
********************************************

Абрамов Александр Васильевич 07101941 Н Ж 0 F Новошешминск Карла_Маркса 91 40 493440
Абрамов Александр Григорьевич 30011954 В Х 7 A Казань Пионерная 129 0 498130
Абрамов Александр Иванович 10031959 Н Ж 7 A Кайбицы Парковая 162 131 650068
Абрамов Александр Константинович 21121965 В Ж 8 A Лениногорск Цветочный 36 178 456048
Абрамов Александр Сергеевич 23031942 С Ж 3 C Новошешминск АкадемикаКурчатова 21 145 163264
Абрамов Анатолий Иванович 08121951 Н Х 0 D Рыбная_Слобода Цветочный 1 96 547932
Владимиров Игорь Петрович 19111945 В Ж 2 B Тетюши Первых_Строителей 75 190 543232
Владимиров Семён Владимирович 31101965 Н Ж 9 D Уруссу Берлин 44 35 460750
Владимиров Юрий Кузьмич 06021952 С Х 8 B Новошешминск Стройбаза 131 21 786640
Власов Пётр Парфёнович 20071975 Н Х 1 D Мензелинск Промкомзона 29 58 118540
Голоднов Алексей Васильевич 17031963 Н Ж 9 B Азнакаево Ленина 116 24 583175
Евдокимов Михаил Сергеевич 22031959 С Ж 6 E Базарные_Maтаки Транспортников 57 23 204100
Евдокимов Николай Иванович 19101941 Н Х 9 F Арск Силикатная 8 61 865276
Евдокимов Юрий Алексеевич 23021959 С Х 6 D Тетюши Промплощадка 189 166 112288
Головачёв Павел Яковлевич 30011951 Н Х 0 B Агрыз Строителей 45 189 270728

#include <iostream>
#include <fstream>
using namespace std;


struct node
{
	char info;
	node * next;
};
void setNull(node * & p)
{
	p = NULL;
}
void createElem(node * & p, char y)
{
	p = new node;
	p->info = y;
	p->next = NULL;
}
void addFirst(node * & head1, node * p)//добавление в начало
{
	p->next = head1;
	head1 = p;
}
void setHead(node * head1, node * & p)
{
	p = head1;
}
bool nodeIsNull(node * p)
{
	return p == NULL;
}
void showNode(node * p)
{
	cout << p->info;
}
void moove(node * & p)
{
	p = p->next;
}
void createListFromFile(node * & head1, ifstream & f)
{
	node * q;
	char x;
	head1 = new node;
	setNull(head1->next);
	node* tail = head1;
	while (f.get(x))
	{
		createElem(q, x);
		tail->next = q;
		tail = q;
	}
	q = head1;
	moove(head1);
	delete q;
}
void showList(node * head)
{
	node * q;
	setHead(head, q);
	while (!nodeIsNull(q))
		{
			showNode(q);
			moove(q);
		}
	cout << endl;
}

void Del(node *& head)
{
	node * q,*temp;
	bool t;
	setHead(head, q);
	while (!nodeIsNull(q))
	{
		if (q->info == ' ')
		{
			t = false;
			temp = q;
			moove(q);
			while (!nodeIsNull(q)&&q->info != ' ')
			{
				if (q->info == 'f')
					t = true;
				moove(q);
			}
			if (t)
				temp->next = q;
		}
		else
		{
			t = false;
			while (!nodeIsNull(q) && q->info != ' ')
			{
				if (q->info == 'f')
					t = true;
				moove(q);
			}
			if (t)
				head = q;
		}

	}
}

int main()
{
	ifstream f("Text.txt");
	node * head1;
	createListFromFile(head1, f);
	showList(head1);

	Del(head1);
	showList(head1);

	system("pause");
    return 0;
}

If wish I   found some better sounds no one’s ever heard
 I wish I had a better voice that sang some better words
 I wish I found some chords in an order that is new
 I wish I didn't have to rhyme every time I sang
 I was told when I get olfder all my fears would shrink

wish I    some better sounds no oneТs ever heard
 I wish I had a better voice that sang some better words
 I wish I  some chords in an order that is new
 I wish I didn't have to rhyme every time I sang
 I was told when I get  all my  would shrink

#include "stdafx.h"
#include <iostream>
#include <fstream>

using namespace std;

struct treeNode
{
	treeNode* left=NULL;
	treeNode* right=NULL;
	char   letter;
	char symbol;
};

struct stackNode
{
	stackNode* next;
	treeNode*  node;
};

void makeTree(treeNode*&start)
{
	treeNode *eNode = new treeNode;
	eNode->letter = 'E';
	eNode->symbol = '.';
	treeNode *iNode = new treeNode;
	iNode->letter = 'I';
	iNode->symbol = '.';
	treeNode *sNode = new treeNode;
	sNode->letter = 'S';
	sNode->symbol = '.';
	treeNode *hNode = new treeNode;
	hNode->symbol = '.';
	hNode->letter = 'H';
	treeNode *vNode = new treeNode;
	vNode->symbol = '-';
	vNode->letter = 'V';
	treeNode *uNode = new treeNode;
	uNode->symbol = '-';
	uNode->letter = 'U';
	treeNode *fNode = new treeNode;
	fNode->symbol = '.';
	fNode->letter = 'F';
	treeNode *aNode = new treeNode;
	aNode->letter = 'A';
	aNode->symbol = '-';
	treeNode *rNode = new treeNode;
	rNode->letter = 'R';
	rNode->symbol = '.';
	treeNode *lNode = new treeNode;
	lNode->letter = 'L';
	lNode->symbol = '.';
	treeNode *wNode = new treeNode;
	wNode->letter = 'W';
	wNode->symbol = '-';
	treeNode *pNode = new treeNode;
	pNode->letter = 'P';
	pNode->symbol = '.';
	treeNode *jNode = new treeNode;
	jNode->letter = 'J';
	jNode->symbol = '-';
	treeNode *tNode = new treeNode;
	tNode->letter = 'T';
	tNode->symbol = '-';
	treeNode *nNode = new treeNode;
	nNode->letter = 'N';
	nNode->symbol = '.';
	treeNode *dNode = new treeNode;
	dNode->letter = 'D';
	dNode->symbol = '.';
	treeNode *bNode = new treeNode;
	bNode->letter = 'B';
	bNode->symbol = '.';
	treeNode *xNode = new treeNode;
	xNode->letter = 'X';
	xNode->symbol = '-';
	treeNode *kNode = new treeNode;
	kNode->letter = 'K';
	kNode->symbol = '-';
	treeNode *cNode = new treeNode;
	cNode->letter = 'C';
	cNode->symbol = '.';
	treeNode *yNode = new treeNode;
	yNode->letter = 'Y';
	yNode->symbol = '-';
	treeNode *mNode = new treeNode;
	mNode->letter = 'M';
	mNode->symbol = '-';
	treeNode *gNode = new treeNode;
	gNode->letter = 'G';
	gNode->symbol = '.';
	treeNode *zNode = new treeNode;
	zNode->letter = 'Z';
	zNode->symbol = '.';
	treeNode *qNode = new treeNode;
	qNode->letter = 'Q';
	qNode->symbol = '-';
	treeNode *oNode = new treeNode;
	oNode->letter = 'O';
	oNode->symbol = '-';

	start->left = eNode;
	eNode->left = iNode;
	iNode->left = sNode;
	sNode->left = hNode;
	sNode->right = vNode;
	iNode->right = uNode;
	uNode->left = fNode;
	eNode->right = aNode;
	aNode->left = rNode;
	rNode->left = lNode;
	aNode->right = wNode;
	wNode->left = pNode;
	wNode->right = jNode;
	start->right = tNode;
	tNode->left = nNode;
	nNode->left = dNode;
	dNode->left = bNode;
	dNode->right = xNode;
	nNode->right = kNode;
	kNode->left = cNode;
	kNode->right = yNode;
	tNode->right = mNode;
	mNode->left = gNode;
	gNode->left = zNode;
	gNode->right = qNode;
	mNode->right = oNode;
}

void write(stackNode* stack_top)
{
	if (stack_top->next)
	{
		write(stack_top->next);
		cout<<stack_top->node->symbol;
	}
}
void push_stack(stackNode* &stack_top, treeNode* t)//вставка
{
	stackNode* p;
	p = new stackNode;
	p->node = t;
	p->next = stack_top;
	stack_top = p;
}

void pop_stack(stackNode* &stack_top, treeNode* &t)// удаление
{
	stackNode *p;
	if (stack_top)
	{
		t = stack_top->node;
		p = stack_top->next;
		delete stack_top;
		stack_top = p;
	}
}

bool research(treeNode* tree_top, char x)
{
	stackNode* stack_top;
	treeNode* tree_p;
	tree_p = tree_top;
	stack_top = NULL;
	bool f= false;
	do
	{
		while (tree_p)
		{
			while (tree_p->left)
			{
				push_stack(stack_top, tree_p);
				tree_p = tree_p->left;
			}
			if (x == tree_p->letter)
				f = true;
			tree_p = tree_p->right;
		}

		if (stack_top)
		{
			pop_stack(stack_top, tree_p);
			if (x == tree_p->letter)
				f = true;
			tree_p = tree_p->right;
		}
	} while (stack_top || tree_p);
	return f;
}

void GG(ifstream&f)
{
	char x;
	treeNode *top = new treeNode;
	top->letter = '0';
	top->symbol = '0';
	top->left = NULL;
	top->right = NULL;
	makeTree(top);
	bool t=false;
	stackNode* stack_top;
	treeNode* tree_p;

	while (f.get(x))
	{
		if (x != ' ')
		{
			t = false;
			tree_p = top;
			stack_top = NULL;
			while (tree_p&&!t)
			{
				if (research(tree_p->left, x))
					tree_p=tree_p->left;
				else
					tree_p = tree_p->right;

				if(tree_p)
					if (tree_p->letter == x)
					{
						cout << tree_p->symbol;
						t = true;
					}
					else
						cout << tree_p->symbol;
			}
			cout << ' ';
		}
	}
}

int main()
{
	ifstream in("Text.txt");
	GG(in);
	system("pause");
    return 0;
}

. ..-
E U