题意:你在椭圆上选n个点, 连n*(n-1)条线,最多将圆分成几块。
算法:F(n) = 1 + C(n,2) + C(n,4);
错误原因: 给你一个int数,在for循环中判断可能溢出,比如for(int i = xx, i <= n; i++) 当n = 2 ^ 31 - 1;最后一个i判断溢出 变成死循环从而超时。
题目链接:点击打开链接
论文神马滴!最有爱了!窝才不会告诉你!资料链接是((不要点啦))~~呜呜个呢!
不许笑窝代码!
import java.math.BigInteger;
import java.math.BigDecimal;
import java.util.Scanner;
import java.io.*;
public class Main {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int m;
m = input.nextInt();
while (m > 0)
{
m--;
long n;
n = input.nextLong();
BigInteger ans = new BigInteger("1");
BigInteger a = new BigInteger("1");
BigInteger b = new BigInteger("1");
for (long i = n - 3; i <= n; i++)
a = a.multiply( BigInteger.valueOf(i));
a = a.divide(BigInteger.valueOf(24));
for (long i = n - 1; i <= n; i++)
b = b.multiply(BigInteger.valueOf(i));
b = b.divide(BigInteger.valueOf(2));
ans = ans.add(a);
ans = ans.add(b);
System.out.println(ans);
}
}
}