4/06/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 "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me

0 Comments: