AMICABLE NUMBER (FRIENDLY NUMBER) OR NOT

-

    

 

Consider the following I/O samples.


SAMPLE INPUT: 220 284

SAMPLE OUTPUT: AMICABLE PAIR


Amicable numbers are two different numbers related in such a way that the sum of the proper divisors of each is equal to the other number.


Sum of divisors of 220 = 284   

Sum of divisors of 284 = 220

sum of 220==284 && sum of 284==220


C PROGRAM:

#include<stdio.h>

int main()

{

   int n1,n2,i,sum1=0,sum2=0;

    scanf("%d %d",&n1,&n2);

    for(i=1;i<n1;i++)

    {

        if(n1%i==0)

            sum1+=i;

    }

    for(i=1;i<n2;i++)

    {

        if(n2%i==0)

            sum2+=i;

    }

    

    if(sum1==n2 && sum2==n1)

        printf("Amicable Pairs");

    else

        printf("Not a Amicable Pairs");

    return 0;

}


OUTPUT:




The given source code in C program "FOR AMICABLE PAIRS OR NOT" is short and simple to understand. The source code is well tested in DEV-C++ and is completely error free. 

If you have any feedback about this article and want to improve this, please comment in the comment section.


Comments

Post a Comment

Popular posts from this blog

C PROGRAM TO PRINT ALL LEAP YEARS IN A GIVEN RANGE

-
Image
Consider the following I/O samples. SAMPLE INPUT :  200 300 SAMPLE OUTPUT:   204 208 212 216 220 224 228 232 236 240 244 248                                             252 256  260 264 268 272 276 280 284 288 292 296 C PROGRAM: #include <stdio.h> int checkLeapYear(int year) {     if( (year % 400==0)||(year%4==0 && year%100!=0) )         return 1;     else         return 0; }   int main() {     int i,n,s;     scanf("%d %d",&s,&n);     printf("Leap years from %d to %d:\n\n",s,n);     for(i=s;i<=n;i++)     {         if(checkLeapYear(i))             printf("%d ",i);     }     return 0; }   OUTPUT:      The ...
Read more

INVERTED PYRAMID STAR PATTERN

-
Image
Consider the following I/O samples. SAMPLE INPUT:   3 SAMPLE OUTPUT:                                                         * * *                                              *   *                                                 *                                                                                 ...
Read more

Design a way to sort the list of positive integers in the descending order according to frequency of elements. The elements with integers with higher frequency come before with lower frequency elements with same frequency come in the same order as they appear the values.

-
Image
          Consider the following I/O samples. SAMPLE INPUT:       6                                            2 2 4 9 9 9 SAMPLE OUTPUT:     9 9 9 2 2 4   C PROGRAM:    #include <stdio.h> #include<limits.h> #include<malloc.h> int * frequencySortArray( int *arr,int size) {      int** occurence = NULL;      int maxpos, count = 0, count_flag, o_row, index,max;      int newindex = 0, num, ctr;      occurence = (int**)calloc(1,sizeof(int*));      occurence[0] = (int*)calloc(2,sizeof(int));      occurence[0][0] = arr[0];      occurence[0][1]++;      count++;      for(index = 1 ; index < size ; index++)      {   ...
Read more