Thursday, 6 April 2017

Geeksforgeeks Solution For " Number that are not divisible "

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 :- Number that are not divisible 

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
using namespace std;
int main()
 {
    int t;
    unsigned long long n,count;
    cin>>t;
    while(t--){
        cin>>n;
        count=n-(n/2)-(n/3)-(n/5)-(n/7)+(n/6)+(n/10)+(n/14)+(n/15)+(n/21)+(n/35)-(n/30)-(n/42)-(n/70)-(n/105)+(n/210);
        cout<<count<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Number that are not divisible "

No comments:
Write comments

Recommended Posts × +