結果

問題 No.534 フィボナッチフィボナッチ数
ユーザー uwiuwi
提出日時 2017-06-23 22:45:32
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,592 bytes
コンパイル時間 3,821 ms
コンパイル使用メモリ 88,156 KB
実行使用メモリ 52,348 KB
最終ジャッジ日時 2024-04-14 05:58:34
合計ジャッジ時間 7,375 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,344 KB
testcase_01 AC 53 ms
50,056 KB
testcase_02 AC 52 ms
50,428 KB
testcase_03 AC 55 ms
50,292 KB
testcase_04 AC 53 ms
50,408 KB
testcase_05 AC 52 ms
50,416 KB
testcase_06 AC 52 ms
50,396 KB
testcase_07 AC 52 ms
50,180 KB
testcase_08 AC 52 ms
50,344 KB
testcase_09 AC 53 ms
51,908 KB
testcase_10 AC 52 ms
50,404 KB
testcase_11 AC 53 ms
50,020 KB
testcase_12 AC 54 ms
50,044 KB
testcase_13 AC 53 ms
50,412 KB
testcase_14 AC 53 ms
50,300 KB
testcase_15 AC 54 ms
50,040 KB
testcase_16 AC 53 ms
50,316 KB
testcase_17 AC 53 ms
49,964 KB
testcase_18 AC 53 ms
49,988 KB
testcase_19 AC 53 ms
50,384 KB
testcase_20 AC 54 ms
49,960 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 54 ms
49,936 KB
testcase_27 AC 54 ms
50,332 KB
testcase_28 WA -
testcase_29 AC 54 ms
50,220 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 54 ms
50,352 KB
testcase_36 AC 54 ms
50,184 KB
testcase_37 AC 54 ms
49,916 KB
testcase_38 WA -
testcase_39 AC 54 ms
50,320 KB
testcase_40 AC 54 ms
50,044 KB
testcase_41 AC 54 ms
50,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170623;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long mod = 1000000007;
		long xmod = mod*(mod+1);
		long n = nl();
		if(n == 0){
			out.println(0);
			return;
		}
		long e = fibr(n, xmod);
		out.println(fib(e, mod));
	}
	
	public static long mulRobust(long a, long b, long mod)
	{
		if(a >= mod || a < 0)a %= mod;
		if(a < 0)a += mod;
		if(b >= mod || b < 0)b %= mod;
		if(b < 0)b += mod;
		
		long ret = 0;
		int step = Long.numberOfLeadingZeros(mod)-1;
		for(int x = 63-Long.numberOfLeadingZeros(b);x >= 0;x-=step){
			int shift = Math.min(x+1, step);
			ret<<=shift;
			ret %= mod;
			
			ret += a*(b>>>x-shift+1&(1L<<shift)-1);
			ret %= mod;
		}
		return ret;
	}
	
	public static long fib(long n, long mod)
	{
		long a = 1, b = 1, d = 0;
		long va = 1, vb = 0;
		
		// (1 1)(1)
		// (1 0)(0)
		for(n--;n>0;n>>>=1){
			if((n&1)==1){
				long nva = (a*va+b*vb)%mod;
				long nvb = (b*va+d*vb)%mod;
				va = nva; vb = nvb;
			}
			
			long na = (a*a+b*b)%mod;
			long nb = (b*(a+d))%mod;
			long nd = (d*d+b*b)%mod;
			a = na; b = nb; d = nd;
		}
		
		return va;
	}
	
	public static long fibr(long n, long mod)
	{
		long a = 1, b = 1, d = 0;
		long va = 1, vb = 0;
		
		// (1 1)(1)
		// (1 0)(0)
		for(n--;n>0;n>>>=1){
			if((n&1)==1){
				long nva = (mulRobust(a, va, mod)+mulRobust(b, vb, mod))%mod;
				long nvb = (mulRobust(b, va, mod)+mulRobust(d, vb, mod)) % mod;
				va = nva; vb = nvb;
			}
			
			long na = (mulRobust(a, a, mod) + mulRobust(b, b, mod))%mod;
			long nb = (mulRobust(b, a+d, mod))%mod;
			long nd = (mulRobust(d, d, mod) + mulRobust(b, b, mod))%mod;
			a = na; b = nb; d = nd;
		}
		
		return va;
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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