Thursday, 6 April 2017

Geeksforgeeks Solution For " 3 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 value N, you need to find how many numbers less than or equal to N have numbers of divisors exactly equal to 3.

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
#include<math.h>
using namespace std;
int isprime(int n)
{
    for(int i=2; i<n; i++)
        if(n%i==0)
            return 0;
    return 1;
}
int check(int n)

{
    int i,c;
    for(i=2,c=0; i<=sqrt(n); i++)
    {
        if(isprime(i))
            c++;
    }
    return c;
}
int main()
 {
int t,n,i;
    cin>>t;
    while(t--){
        cin>>n;
        cout<<check(n)<<'\n';
    }
return 0;
}

Output:-



Geeksforgeeks Solution For " 3 Divisors "

No comments:
Write comments

Recommended Posts × +