public class Testor { public static void main(final String[] args) { int t = 0; int m = 1; int r = 0; while (r <= 9999) { m *= ++t; r += m; } System.out.println(t - 1); } }本回答被提问者采纳
第2个回答 2010-11-18
算法:
int f(int n)//求n! { int i = 0; int z = 1 for(i=1;i<=n;i++) z = z * i; return z; } int F()//求n { int i = 0; int sum =0 ; for(i=1;i<=n;i++) { sum = sum + f(i); if(sum>9999) break; } return i-1;//满足1+2!+3!……+n!<=9999的最大整数n = i-1