poj2680

最新推荐文章于 2025-09-06 09:33:29 发布

转载最新推荐文章于 2025-09-06 09:33:29 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/rainydays/archive/2011/09/13/2174350.html

文章标签：

#java

递推+高精度

java做

View Code

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {
public static void main(String[] args)
    {
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        BigInteger f[] = new BigInteger[1005];
        f[0] = new BigInteger("0");
        f[1] = new BigInteger("1");
        f[2] = new BigInteger("1");
for (int i = 3; i <= 1001; i++)
            f[i] = f[i - 2].add(new BigInteger("2").pow(i - 2));
while (cin.hasNext())
        {
int n = cin.nextInt();
            System.out.println(f[n - 1]);
        }
    }
}