HDU-1042-N!(Java大法好 && HDU大数水题)
2024-08-26 12:37:25
N!
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 64256 Accepted Submission(s): 18286
Problem Description
Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!
Input
One N in one line, process to the end of file.
Output
For each N, output N! in one line.
Sample Input
1
2
3
Sample Output
1
2
6
Author
JGShining(极光炫影)
Recommend
We have carefully selected several similar problems for you: 1715 1047
pid=1063" target="_blank" style="color:rgb(26,92,200); text-decoration:none">1063
1753 1316
Java大法好。退C保平安.......开玩笑的,Java和C各有各的优劣势,缺一不可!
我不会大数模版。就用BigInteger了,HDU大数水题不解释!
import java.io.*;
import java.math.BigInteger;
import java.util.*; public class Main
{ public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
while(input.hasNext())
{
int n = input.nextInt();
BigInteger p = BigInteger.ONE;
for(int i=1;i<=n;i++)
{
p=p.multiply(BigInteger.valueOf(i));
}
System.out.println(p);
}
} }
最新文章
- MongoDB基础入门001--安装
- HTTP请求 GET POST 网络编程实现
- PBR实现2.0
- mysql 数据库服务中的应用程序
- Testcase篇
- c语常用算法库(1)
- char *p 和char *p[]
- 一些tcp通讯代码
- juit测试中报错:org.hibernate.HibernateException: Unable to get the default Bean Validation factory
- .net task
- data.table包简介
- C# 文件去仅仅读工具-线程-技术&;amp;分享
- Android SDK manager里面什么是必须下载的?
- 最长公共子序列-LCS问题 (LCS与LIS在特殊条件下的转换) [洛谷1439]
- Adding a custom jar as a maven dependency
- 使用svn导入项目
- AngularJS实战之ng-repeat的详细用法
- Logistic Regression – Geometric Intuition
- android 在HTML中显示bitmap
- 关于 Unity 的一些小细节,不注意可能会被“坑”一些时间。