Thursday, 6 April 2017

Geeksforgeeks Solution For " Count digits in a factorial "

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 :- Count digits in a factorial

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
long long findDigits(int n)
{
if (n < 0)
return 0;
if (n <= 1)
return 1;
double x = ((n*log10(n/M_E)+log10(2*M_PI*n)/2.0));
return floor(x)+1;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        cout<<findDigits(n)<<endl;
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Count digits in a factorial "

No comments:
Write comments

Recommended Posts × +