Thursday, 6 April 2017

Geeksforgeeks Solution For " Perfect Numbers "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Perfect Numbers 

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       int n,i,sum=0,n1;
       cin>>n;
       n1=n;
       for(i=1;i<=n/2;i++)
       {
           if(n%i==0)
           {
               sum+=i;
           }
       }
       if(sum==n1||n1==1)
       cout<<"1\n";
       else
       cout<<"0\n";
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Perfect Numbers "

No comments:
Write comments

Recommended Posts × +