Write a program to find whether the given number is a perfect number or not using functions.

Source Code

#include<stdio.h>
#include<conio.h>
int perfect(int num)
{
  int i,c=0,per=0;
  int ar[100];
  for(i=0;i<100;i++)
  {
    ar[i]=0;
  }
  for(i=1;i<num;i++)
  {
       if(num%i==0)
       {
    ar[c]=i;
    c++;
       }
  }
  for(i=0;i<c;i++)
  {
    per+=ar[i];
  }
  return per;
}
int main (int argc, char *argv[])
{
  clrscr();
  int n,p;
  printf("\n Enter the number: ");
  scanf("%d",&n);
  p=perfect(n);
  printf("\n The number %d is",n);
  if(n==p)
    printf(" perfect number");
  else
    printf(" not an perfect number");
  getch();
}

Find More from our code collection
Armstrong number, binary number to a decimal number, bubble sort, decimal number to binary number, factorial of the given number factors, fibonacci numbers, HCF and LCM, matrix, mergesort, salary of the employee. palindrome, quadratic equation, star patterns, series etc. and much more...
#Return to Example Source Code