結果

問題 No.181 A↑↑N mod M
コンテスト
ユーザー ぴろず
提出日時 2015-04-06 20:04:56
言語 Java
(openjdk 23)
結果
AC  
実行時間 53 ms / 5,000 ms
コード長 5,290 bytes
コンパイル時間 2,309 ms
コンパイル使用メモリ 78,064 KB
実行使用メモリ 37,232 KB
最終ジャッジ日時 2024-11-24 03:21:54
合計ジャッジ時間 5,517 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no181;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();

	public static long MAX = 1L<<32L;

	public static void main(String[] args) {
//		System.out.println(hyper4(3, 5));
		long t = 1; // io.nextInt();
		for(int i=0;i<t;i++) {
			long a = io.nextLong();
			long n = io.nextLong();
			long m = io.nextLong();
			io.println(hyper4Mod(a, n, m));
		}
		io.flush();
	}

	public static long hyper4Mod(long a,long n,long m) {
		if (m == 1) {
			return 0;
		}
		if (n == 0) {
			return 1;
		}
		long p = hyper4(a,n-1);
		if (p < MAX) {
			return modPow(a, p, m);
		}else{
			long c = eulerPhi(m);
			return modPow(a, MAX + mod(hyper4Mod(a, n-1, c) - MAX,c), m);
		}
	}

	//min(hyper4(a,n) , 2^32)
	public static long hyper4(long a,long n) {
		if (n == 0) {
			return 1;
		}
		if (a <= 1 || n == 1) {
			return a;
		}
		if (n >= 5) { // >= 2^65536 >= 2^32
			return MAX;
		}
		if (a >= 10) { // >= 10^10 >= 2^32
			return MAX;
		}
		n = hyper4(a,n-1);
		if (n >= 32) { // >= 2^32
			return MAX;
		}
		long x = 1;
		for(int i=0;i<n;i++) {
			x *= a;
			if (x >= MAX) {
				return MAX;
			}
		}
		return x;
	}

	public static long modPow(long a,long n,long m) {
		long res = 1;
		while(n > 0) {
			if ((n & 1) > 0) {
				res = (res * a) % m;
			}
			a = (a * a) % m;
			n/=2;
		}
		return res;
	}

	public static long eulerPhi(long n) {
		long res = n;
		for(long i=2;i*i<=n;i++) {
			if (n % i == 0) {
				res = res / i * (i - 1);
			}
			while(n % i == 0) {
				n /= i;
			}
		}
		if (n != 1) {
			res = res / n * (n - 1);
		}
		return res;
	}

	public static long mod(long a,long m) {
		a %= m;
		if (a < 0) {
			a += m;
		}
		return a;
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0