Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 40121

small factorials ! wrong answer but it is working just the right way in my system

$
0
0

include<stdio.h>

include<string.h>

include<iomanip>

include<iostream>

using namespace std; long double fact(int); int main() { int t,n,i=0;

long double sol[100]; scanf("%d",&t); while(i<t) { scanf("%d",&n); sol[i]=fact(n); ++i; } cout<<endl; for(i=0;i<t;i++) cout<<setprecision(160)<<sol[i]<<endl;

return 0;

} long double fact(int f) { if(f==0) return 1; else return f*fact(f-1); }


Viewing all articles
Browse latest Browse all 40121

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>