#include <stdio.h>

// here it is
 ??? someFunc()
{
  return ???
}



int main()
{
  //i wan't to display a result from someFunc
  
  printf(" result = %s",someFunc());
  return 0;
}

#include <stdio.h>//memory leak debugger#define CRTDBG_MAP_ALLOCstruct WSTRUCT;//this is our wordsstruct WSTRUCT *words;void AddWord(char* word,int length);void FreeWords();struct WSTRUCT{      //word   char* word;   //pointer to next struct NULL if none   struct WSTRUCT *next;};//frees memory usedvoid FreeWords(){    //temp value used for freeing memory	struct WSTRUCT *temp;	while(words != NULL)   {      if(words->word != NULL)	  free(words->word);      	  temp = words;      	  //we select next item in the list	  words = words->next;	  //but we need to free current item	  free(temp);   }	//kill it	temp = NULL;}void AddWord(char* word,int length){	struct WSTRUCT *temp;	temp = words;	//this indicates that the are no 	//words in a list	//so we add word and exit	if(words == NULL)	{		//now we create new structure        words = (struct WSTRUCT*)malloc(sizeof(struct WSTRUCT));		//we create a new word        words->word = (char*)malloc(sizeof(char) * length); 		//and write a value to it	//	sprintf(words->word,"%s",word);	    _snprintf(words->word, length, "%.*s",length, word);		 		//and point the next pointer		//to NULL		words->next = NULL;		return;	}    else    while(temp->next != NULL)	{     temp = temp->next;	}	//now temp is the last structure we have	//so let's make it work     temp->next = (struct WSTRUCT*)malloc(sizeof(struct WSTRUCT));		//we create a new word     temp->next->word = (char*)malloc(sizeof(char) * length); 		//and write a value to it     sprintf(temp->next->word,"%.*s",length,word);		//and point the next pointer		//to NULL	 temp->next->next = NULL;	return;}//we output the word from the list// RETURNS:// NULL          - list is empty// NOT_FOUND     - there is no position in this list// ...           - we have found the wordchar* GetWord(int number){   int i = 0;    struct WSTRUCT *temp;      //checking is our words empty ?   if(words == NULL)   {	  temp = NULL;	  return "NULL";   }   temp = words;   //we walk untile we get the required word or until it's the end   for(i = 0; (i < number) && (temp->next != NULL);i++ )   {	   temp = temp->next;   }   //here it is   //we check have ve reached the desired number ?   if(i == number)   {	  //again we check if our word is empty or not      if(temp->word != NULL)	  //here is the place when we return STATIC? variable 	  return temp->word;      else 	  {		    temp = NULL;		   return "NULL";	  }   }   else //We have not found this position   {	   temp = NULL;	   return "NOT_FOUND";   }   temp = NULL;}int main(){   //let's make it clear that it is empty   words = NULL;   //now we just add a word and show the first 3 positions   printf("\n NO WORDS :\n\n");   printf("1=%s\n2=%s\n3=%s\n",GetWord(0),GetWord(1),GetWord(2));     printf("\n 1 WORD :\n\n");   //add new word   AddWord("word1",6);   printf("1=%s\n2=%s\n3=%s\n",GetWord(0),GetWord(1),GetWord(2));   printf("\n 2 WORDS :\n\n");   AddWord("word2",6);   printf("1=%s\n2=%s\n3=%s\n",GetWord(0),GetWord(1),GetWord(2));   printf("\n 3 WORDS :\n\n");   AddWord("word3",6);   printf("1=%s\n2=%s\n3=%s\n",GetWord(0),GetWord(1),GetWord(2));    printf("\n FREE () :\n\n");   //frees mem   FreeWords();   printf("1=%s\n2=%s\n3=%s\n",GetWord(0),GetWord(1),GetWord(2));     //searching for mempry leaks   _CrtDumpMemoryLeaks();  return 0;}