//copy the part below this

#include <iostream>
using namespace std;
int FactCount(int nLoopCount);

/*simple factoring program written by David Tarsi.Will function well on
 a machine with at least 64 megs of ram at around 400 mhz.
 gets slow above inputs over 36000.Any suggestions welcome at dtarsi@premier1.net
 Any one may use this program providing this documentation is included.The author assumes absolutely
 no responsibility whatsoever for any consequenses or damages resulting from the use of this program */


 int main()

{
	int input;
	cout << "Enter Number to be factored:\n";
        cin  >> input;
		FactCount(input);
return 0;
}            			

	

	                     
	int FactCount(int nLoopCount){
	int nFirst;					
	if(nLoopCount > 1000000){	//prevent long loop count
	   nLoopCount = 0;
	cout << "Number to be factored must be less than 1000000:\n";
	}
		
     for (int j=2; j <= nLoopCount; j++){   //loops through int and stops a point set by nLoopCount
		for (int i=2; i <=nLoopCount; i++){  //loops through the other number in the factors
	     nFirst = j*i;                       //multiplies the 2 numbers together nLoopCount times

		if(nFirst > 1000000)
			break;
		
		if(nFirst == nLoopCount){ //sort out the numbers we want
		
		
		cout << j <<" * "<< i <<"  =  "<< nFirst << "  sum of factors =   "<< j+i <<
		"  difference of factors =  " << j-i << " , " << i-j << "\n"; //display result
	
	if(j < i)
	break;
	return 0;
			
	}
	}
    }
	}





//copy the part above this