結果

問題 No.303 割れません
ユーザー uwiuwi
提出日時 2015-11-14 00:12:20
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,683 bytes
コンパイル時間 4,118 ms
コンパイル使用メモリ 81,000 KB
実行使用メモリ 110,756 KB
最終ジャッジ日時 2024-09-13 16:29:21
合計ジャッジ時間 38,956 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,532 KB
testcase_01 AC 54 ms
50,464 KB
testcase_02 AC 54 ms
50,240 KB
testcase_03 AC 1,730 ms
101,328 KB
testcase_04 AC 3,321 ms
106,592 KB
testcase_05 AC 3,469 ms
107,384 KB
testcase_06 AC 3,058 ms
106,200 KB
testcase_07 AC 3,401 ms
106,012 KB
testcase_08 AC 3,345 ms
105,448 KB
testcase_09 AC 4,172 ms
110,756 KB
testcase_10 WA -
testcase_11 AC 3,317 ms
106,348 KB
testcase_12 AC 3,292 ms
105,432 KB
testcase_13 AC 2,421 ms
106,992 KB
testcase_14 AC 1,158 ms
64,112 KB
testcase_15 AC 926 ms
63,048 KB
testcase_16 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q831_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		if(n == 2){
			out.println(4);
			out.println("INF");
			return;
		}
		
		out.println(n);
		if(n % 2 == 0){
			BigInteger[] h = F(n/2);
			out.println(h[0].multiply(h[1]).shiftLeft(1));
		}else{
			out.println(F(n)[0]);
		}
	}
	
	public static BigInteger[] F(long n)
	{
		BigInteger a = BigInteger.ONE, b = BigInteger.ONE, d = BigInteger.ZERO;
		BigInteger va = BigInteger.ONE, vb = BigInteger.ZERO;
		
		for(n--;n>0;n>>>=1){
			if((n&1)==1){
				BigInteger nva = a.multiply(va).add(b.multiply(vb));
				BigInteger nvb = b.multiply(va).add(d.multiply(vb));
				va = nva;
				vb = nvb;
			}
			if(n <= 1)break;
			
			BigInteger b2 = b.multiply(b);
//			BigInteger na = a.multiply(a).add(b2);
			BigInteger nb = b.multiply(a.add(d));
			BigInteger nd = d.multiply(d).add(b2);
			a = nb.add(nd); b = nb; d = nd;
		}
		
		return new BigInteger[]{va, vb};
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q831_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0