[projecteuler]Factorial digit sum
2014-04-28 18:09
375 查看
题目:http://projecteuler.net/problem=20
代码:
import java.math.BigInteger;
public class Main{
public static void main(String args[])
{
BigInteger b = new BigInteger("1");
BigInteger temp = new BigInteger("2");
for(int i=2; i<=100; i++)
{
temp = BigInteger.valueOf(i);
b = b.multiply(temp);
}
int res = 0;
BigInteger qu[] = new BigInteger[2];
while(b.compareTo(new BigInteger("0")) != 0 )
{
qu = b.divideAndRemainder(new BigInteger("10"));
res += qu[1].intValue();
b = qu[0];
}
System.out.println(res);
}
}
代码:
import java.math.BigInteger;
public class Main{
public static void main(String args[])
{
BigInteger b = new BigInteger("1");
BigInteger temp = new BigInteger("2");
for(int i=2; i<=100; i++)
{
temp = BigInteger.valueOf(i);
b = b.multiply(temp);
}
int res = 0;
BigInteger qu[] = new BigInteger[2];
while(b.compareTo(new BigInteger("0")) != 0 )
{
qu = b.divideAndRemainder(new BigInteger("10"));
res += qu[1].intValue();
b = qu[0];
}
System.out.println(res);
}
}
相关文章推荐
- projecteuler---->problem=20----Factorial digit sum
- ProjectEuler-Problem20-Factorial digit sum
- Project Euler 题解 #20 Factorial digit sum
- 欧拉项目 第20题 Factorial digit sum
- Matlab 编程 Project Euler Problem 20 Factorial digit sum
- PE 020 Factorial digit sum
- Project Euler 20 Factorial digit sum(大数乘法)
- project euler 20 Factorial digit sum
- projecteuler---->problem=16----Power digit sum
- Project Euler:Problem 20 Factorial digit sum
- Problem 20 Factorial digit sum (阶乘数和)
- Project Euler Problem 20 Factorial digit sum
- Problem 20:Factorial digit sum
- ProjectEuler-Problem 16-Power digit sum
- 20 Factorial digit sum - Project Euler
- HDU 5710 Digit-Sum (构造)
- projecteuler---->problem=18----Maximum path sum I
- projecteuler---->problem=25----1000-digit Fibonacci number
- projecteuler---->problem=30----Digit fifth powers
- lucky sum of digit