// Find the First N Perfect Numbers
// A Perfect Number is a Number that is the Sum of All Divisors
//	Less Than Itself

#include <iostream.h>

int SumOfDivisors(int);

void main()
{int PerfectsToFind,PerfectsFound=0,NumberBeingTested;
 cout << "How Many Perfects To Find? >";
 cin >> PerfectsToFind;
 for (NumberBeingTested=2;PerfectsFound<PerfectsToFind;NumberBeingTested++)
  if (SumOfDivisors(NumberBeingTested)==NumberBeingTested) {
   PerfectsFound++;
   cout << NumberBeingTested << " is a Perfect Number\n";
  }
}

int SumOfDivisors(int N)
{int i,Sum=0;
 for (i=1;i<N;i++)
  if (!(N%i))
   Sum+=i;
 return(Sum);
}