1 solutions
-
0
C :
#include"stdio.h" int main() { int m,n,i,j,fac; scanf("%d",&m); for(j=0;j<m;j++) { fac=1; scanf("%d",&n); for(i=1;i<=n;i++) { fac*=i; } printf("%d\n",fac); } }C++ :
#include<cstdio> main(){int i,t,ans,n;scanf("%d",&t); while(t--){scanf("%d",&n);ans=1;for(i=2;i<=n;i++)ans*=i;printf("%d\n",ans);} }Pascal :
var t,i,n,s,j:longint; begin readln(t); for i:=1 to t do begin readln(n); s:=1; for j:=1 to n do s:=s*j; writeln(s); end; end.Java :
import java.io.*; import java.util.*; import java.math.BigInteger; public class Main{ public static void main(String[] args){ Scanner read=new Scanner(System.in); int t=read.nextInt(); for(int CASE=1;CASE<=t;CASE++){ int fac=1,n=read.nextInt(); for(int i=1;i<=n;i++){ fac*=i; } System.out.println(fac); } } }
- 1
Information
- ID
- 19608
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- (None)
- # Submissions
- 0
- Accepted
- 0
- Uploaded By