NYOJ 大數類總結(java)

來源:互聯網
上載者:User

標籤:java   nyoj   

棋盤覆蓋

題目連結:http://acm.nyist.net/JudgeOnline/problem.php?pid=45

範例輸入
3123
範例輸出
1521

代碼如下:

import java.io.*;import java.util.*;import java.math.BigDecimal;import java.math.BigInteger;//聲明BigInteger大數類public class Main{    public static void main(String args[])    {        Scanner cin = new Scanner(System.in);        int t=cin.nextInt();        while(t-->0)        {        int n;        n=cin.nextInt();        BigInteger a=BigInteger.valueOf(4);        for(int i=1; i<n; ++i)        a=a.multiply(BigInteger.valueOf(4));        System.out.println(a.subtract(BigInteger.valueOf(1)).divide(BigInteger.valueOf(3)));        }    }}

比較大小

題目連結:http://acm.nyist.net/JudgeOnline/problem.php?pid=73

範例輸入
111111111111111111111111111 88888888888888888888-1111111111111111111111111  222222220 0
範例輸出
a>ba<b

代碼如下:

import java.io.*;import java.util.*;import java.math.BigDecimal;import java.math.BigInteger;//聲明BigInteger大數類public class Main{    public static void main(String args[])    {        Scanner cin = new Scanner(System.in);        while(cin.hasNext())        {        BigInteger a=cin.nextBigInteger();        BigInteger b=cin.nextBigInteger();        BigInteger zero=BigInteger.ZERO;        if(a.compareTo(zero)==0&&b.compareTo(zero)==0) break;        int f=a.compareTo(b);        if(f==-1)        System.out.println("a<b");        else if(f==0)        System.out.println("a==b");        else         System.out.println("a>b");        }    }}

遞推求值

題目連結:http://acm.nyist.net/JudgeOnline/problem.php?pid=114

範例輸入
1 1 1
範例輸出
69087442470169316923566147

代碼如下:

import java.io.*;import java.util.*;import java.math.BigDecimal;import java.math.BigInteger;//聲明BigInteger大數類public class Main{    public static void main(String args[])    {        Scanner cin = new Scanner(System.in);        BigInteger fac[]=new BigInteger[100];        while(cin.hasNext())        {        for(int i=0; i<=2; ++i)        fac[i]=cin.nextBigInteger();        for(int i=3; i<=99; ++i)        fac[i]=fac[i-1].add(fac[i-2]).add(fac[i-3]);        System.out.println(fac[99]);        }    }}


著作權聲明:本文為博主原創文章,未經博主允許不得轉載。

NYOJ 大數類總結(java)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.