Perfect Number using Recursion

One comment on “Perfect Number using Recursion”


  • Sushil

    #include
    int Perfect(int n,int sum,int t)
    {
    if(n%t==0 && t<n)
    {
    sum=sum+t;
    }
    if(t<n)
    {
    t++;
    Perfect(n,sum,t);
    }
    else if(t==n)
    {
    return sum;
    }
    }
    int main()
    {
    int n;
    printf("Enter a number:\n");
    scanf("%d",&n);
    int i,sum=0,t=1;
    sum=Perfect(n,sum,t);
    if(sum==n)
    {
    printf("\n%d is perfect number.",n);
    }
    else
    {
    printf("\n%d is not perfect number.",n);
    }
    }