#include <stdio.h>

#define SIZE 10

main(){
	long int 	numbers[SIZE];
	int			index1,
				index2;
	char		same;

	for(index1 = 0; index1<SIZE; index1++){
		do{
			printf("Enter number(#%d): ",index1+1);
			scanf("%ld",&numbers[index1]);
			same = 0;
			//Checks to see if number entered is already in array.
			for(index2 = 0; index2<index1; index2++){
				if(numbers[index1] == numbers[index2]){
					same = 1;
					break;
				}
			}
			//If number was already found then same would equal 1
			if(!same)
				printf("Added #%ld\n",numbers[index1]);
			else
				printf("That number is already there!  Try again.\n");
		}while(same);  //Loop if the number is the same and ask for another number.
	}
}

#include <math.h>
#include <malloc.h>

#define NUM_CHAR 48					//Number to add to get from a numeric digit to an ascii representation
#define	SIZE_NUM 9

char* sep_number(long int number)
{
	char* 		solution = (char*) malloc((SIZE_NUM+1)*sizeof(char));
	long int	divider;

	for(int index = 0; index<SIZE_NUM; index++){
		//This line calculates the number to divide by in the form of 10^(SIZE_NUM-index)
		//1st run Example: 100000000
		divider = (long int) pow( (double) 10, (double) ((SIZE_NUM-1)-index) );

		//This line does integer division to isolate out the first number left in the large number
		//First run example: 123456789 / 10000000 = 1.23456789, the integer portion is 1.
		*(solution+index) = (char) (number / divider);

		//This line reduces the number to subtract off the first number.
		//Note that this does not change the original number only the copy that we have passed to this function.
		//123456789-100000000 = 23456789
		number -= ( *(solution+index) * divider );

		//This line puts the found char in ASCII MODE.
		*(solution+index) += NUM_CHAR;
	}
return(solution);
}

main(){
	char*	split;
	long	new_number;
	char	same;
	list*	numbers;

	numbers = load_numbers(FILENAME);
	print_numbers(numbers);


	do{
		new_number = ra();
		same = 0;
		if(!numbers->is_empty()){
			numbers->home();
			do{
				if(*(long*)(numbers->get_data()) == new_number){
					same = 1;
					break;
				}
			}while(numbers->next());
		}
		if(!same){
			numbers->add_data((void*) &new_number);
			split = sep_number(new_number);
			printf("String number is: %s\n",split);
			print_numbers(numbers);
		}
		else
			printf("That number is already there.  Finding new number\n");
	}while(same);

	save_numbers(FILENAME,numbers);

	return 0;
}

list* load_numbers(char* filename)
{
	list* numbers = new list;
	FILE* fp = fopen(filename,"r");
	long *number = new long;

	if(fp){
		while(fscanf(fp,"%ld",number) != EOF){
			numbers->add_data((void*) number);
			number = new long;
		}
		fclose(fp);
	}

	return(numbers);
}

void save_numbers(char* filename, list* numbers)
{
	FILE* fp;

	if(!numbers->is_empty()){
		fp = fopen(filename,"w");
		numbers->home();
		do{
			fprintf(fp,"%ld\n",*(long*)(numbers->get_data()));
		}while(numbers->next());
		fclose(fp);
	}
}

void print_numbers(list* numbers)
{
	int		count = 1;

	printf("Listing of numbers:\n");
	if(!numbers->is_empty()){
		numbers->home();
		do{
			printf("#%d: %ld\n",count,*(long*)(numbers->get_data()));
			count++;
		}while(numbers->next());
	}
	else
		printf("List is empty.\n");
	printf("\n");

}

ng ra(){
	long number;
	time_t t1;

	(void) time(&t1);

	srand48((long) t1);
	number = lrand48()%1000000000;

	return(number);
}

#include <stdio.h>
#include <math.h>
#include <malloc.h>
#include <sys/types.h>
#include <time.h>
#include <stdlib.h>
#include "list1.h"

#define FILENAME "numbers.tst"
#define NUM_CHAR 48					//Number to add to get from a numeric digit to an ascii representation
#define	SIZE_NUM 9

char* sep_number(long int number)
{
	char* 		solution = (char*) malloc((SIZE_NUM+1)*sizeof(char));
	long int	divider;

	for(int index = 0; index<SIZE_NUM; index++){
		//This line calculates the number to divide by in the form of 10^(SIZE_NUM-index)
		//1st run Example: 100000000
		divider = (long int) pow( (double) 10, (double) ((SIZE_NUM-1)-index) );

		//This line does integer division to isolate out the first number left in the large number
		//First run example: 123456789 / 10000000 = 1.23456789, the integer portion is 1.
		*(solution+index) = (char) (number / divider);

		//This line reduces the number to subtract off the first number.
		//Note that this does not change the original number only the copy that we have passed to this function.
		//123456789-100000000 = 23456789
		number -= ( *(solution+index) * divider );

		//This line puts the found char in ASCII MODE.
		*(solution+index) += NUM_CHAR;
	}
  *(solution+SIZE_NUM) = NULL;
return(solution);
}

int index;

for(index = 0; index<SIZE_NUM, index++){

number -= ( ( (int) *(solution+index) ) * divider );

else{
      printf("That number is already there.  Finding new number\n");
      sleep(1);
}