4/06/2017

Geeksforgeeks Solution For " Square Divisors "

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 :- Given a number N.Your task is to print the no of divisors of number N which are perfect squares.

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
cin>>t;
    while(t--)
    {
    int i,j,res=0;
    unsigned long long int n;
    
    cin>>n;
        for(j=1;j*j<=n;j++)
        {
            if(n%(j*j) == 0)
            {
                res++;
            }
        }
        cout<<res<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Square Divisors "

Ghanendra Yadav

Ghanendra Yadav

Hello, I Am Ghanendra Yadav Owner of This Blog, I am professional Blogger and Programmer. I Love Programming, Logo Making, And Banner Designing. My Highest Qualification is MCA From NIT Warangal. You Can Find Me On Social Media Through Below Link And If You Have Any Query Related To Programming And Other Subject Comment Below or You Can Mail Me I Will Try To Answer Within 24 Hours Email:- yghanendra@student.nitw.ac.in

Find me on Social Media

Facebook | Twitter | Google+ | RSS Feed

No comments:

Post a Comment