// 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 SumOfDigits(long);
int ProductOfDigits(long);

void main()
{int ArmstrongsToFind,ArmstrongsFound=0;
 long NumberBeingTested;
 cout << "How Many Armstrongs To Find? >";
 cin >> ArmstrongsToFind;
 for (NumberBeingTested=0;ArmstrongsFound<ArmstrongsToFind;NumberBeingTested++)
  if (SumOfDigits(NumberBeingTested)*ProductOfDigits(NumberBeingTested)==
							NumberBeingTested) {
   ArmstrongsFound++;
   cout << NumberBeingTested << " is a Armstrong Number\n";
  }
}

int SumOfDigits(long N)
{int digit,Sum=0;
 do {
  Sum+=N%10;
  N/=10;
 } while (N>0);
 return(Sum);
}

int ProductOfDigits(long N)
{int digit,Product=1;
 do {
  Product*=N%10;
  N/=10;
 } while (N>0);
 return(Product);
}