#include <iostream>
using namespace std;

#include <fstream>
using namespace std;

#ifndef _FWORD_
#define _FWORD_
#endif

#ifndef _FSTREAM_
#include <fstream>
#endif

#ifndef NULL
#define NULL 0
#endif

struct L_word{
	int wordc;
	char* wordv;
	struct L_word* next;
};
void L_word_add(struct L_word *&p,char* argv,int argc){
	struct L_word* new_node;
	struct L_word* aux_node;
	new_node=new struct L_word;
	new_node->next=NULL;
	new_node->wordc=argc;
	new_node->wordv=argv;
	if(p==NULL){
		p=new_node;
	}else{
		aux_node=p;
		while(aux_node->next!=NULL){
			aux_node=aux_node->next;
		}
		aux_node->next=new_node;
	}
};
struct L_word* L_fword(char* file_name){
	struct L_word* pointer=NULL;
	fstream file(file_name,ios::in|ios::binary);
	if(file.good()){
		bool w=false;
		while(!w){
			int argc;
			char aux;
			
			do{
				argc=0;
				do{
					file.read(reinterpret_cast<char*>(&aux),sizeof(char));
					w=file.eof();
					argc++;
				}while((aux!=' ')&&(aux!='\n')&&(aux!='\t')&&(aux!='\0')&&(aux!=char(13))&&(!w));
			}while((argc<2)&&(!w));

			char* argv;
			argv=new char[argc];

			if(w){
				file.clear();
				file.seekg(-argc+1,ios::cur);
				file.read(reinterpret_cast<char*>(argv),sizeof(char)*(argc-2));
				file.read(reinterpret_cast<char*>(&aux),sizeof(char));
				argv[argc-2]=aux;
			}else{
				file.seekg(-argc,ios::cur);
				file.read(reinterpret_cast<char*>(argv),sizeof(char)*(argc-1));
			}
			argv[argc-1]='\0';
			L_word_add(pointer,argv,argc);
			file.seekg(1,ios::cur);
		}
	}
	file.close();
	return pointer;
};

class Objeto{...};

int main(int argc,char*argv[]){
	Objeto* puntero;
	puntero=new Objeto; /*se reserva la memoria*/
	/*Operaciones con el objeto*/{...};
	delete puntero; /*se libera la memoria*/
	return 0;
}

class A{
private:
	int** dato;
	int Indice_1,Indice_2;
public:
	void crear(int X,int Y){
		//Se define el tamaño del array dato
		Indice_1=X;
		Indice_2=Y;
		//Se reserva la memoria (Array Dinámico)
		dato=new int *[X];
		for(int i=0;i<X;i++){
			dato[i]=new int [Y];
			for(int j=0;j<Y;j++){
				dato[i][j]=0;
			}
		}
	}
	~A(){
		//Se libera la memoria
		for(int i=0;i<Indice_1;i++){
			delete[] dato[i];
		}
		delete[] dato;
	}
};

void borrarA(){
        //Se libera la memoria
        for(int i=0;i<Indice_1;i++){
		delete[] dato[i];
	}
	delete[] dato;
	}