結果
| 問題 | No.1255 ハイレーツ・オブ・ボリビアン |
| ユーザー |
 uwi
|
| 提出日時 | 2020-10-09 21:58:51 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 87 ms / 2,000 ms |
| コード長 | 5,862 bytes |
| コンパイル時間 | 4,720 ms |
| コンパイル使用メモリ | 83,676 KB |
| 実行使用メモリ | 51,416 KB |
| 最終ジャッジ日時 | 2024-07-23 08:42:31 |
| 合計ジャッジ時間 | 6,016 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 15 |
ソースコード
package contest201009;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 G {InputStream is;PrintWriter out;String INPUT = "";void solve(){int[] primes = sieveEratosthenes(100000);for(int T = ni();T > 0;T--){int n = ni();int p = 2*n-1;int t = (int)totient(p, primes);int[] f = facs(t, primes);int e = t;for(int d : f){while(e % d == 0 && pow(2, e/d, p) == 1 % p){e /= d;}}out.println(e);}}public static int[] sieveEratosthenes(int n) {if (n <= 32) {int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};for (int i = 0; i < primes.length; i++) {if (n < primes[i]) {return Arrays.copyOf(primes, i);}}return primes;}int u = n + 32;double lu = Math.log(u);int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];ret[0] = 2;int pos = 1;int[] isnp = new int[(n + 1) / 32 / 2 + 1];int sup = (n + 1) / 32 / 2 + 1;int[] tprimes = {3, 5, 7, 11, 13, 17, 19, 23, 29, 31};for (int tp : tprimes) {ret[pos++] = tp;int[] ptn = new int[tp];for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31);for (int j = 0; j < sup; j += tp) {for (int i = 0; i < tp && i + j < sup; i++) {isnp[j + i] |= ptn[i];}}}// 3,5,7// 2x+3=nint[] magic = {0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14};int h = n / 2;for (int i = 0; i < sup; i++) {for (int j = ~isnp[i]; j != 0; j &= j - 1) {int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];int p = 2 * pp + 3;if (p > n) break;ret[pos++] = p;if ((long) p * p > n) continue;for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q;}}return Arrays.copyOf(ret, pos);}public static long periodOfRiffleShuffle(int n, int[] primes){if(n % 2 != 0)throw new RuntimeException();if(n == 2)return 1;int p = n-1;int t = (int)totient(p, primes);int[] f = facs(t, primes);if(pow(4, t, p) != 1%p)return -1;int e = t;for(int d : f){while(e % d == 0 && pow(4, e/d, p) == 1 % p){e /= d;}}return e*2;}public static int[] facs(int n, int[] primes){int[] ret = new int[9];int rp = 0;for(int p : primes){if(p * p > n)break;int i;for(i = 0;n % p == 0;n /= p, i++);if(i > 0)ret[rp++] = p;}if(n != 1)ret[rp++] = n;return Arrays.copyOf(ret, rp);}public static long pow(long a, long n, long mod) {// a %= mod;long ret = 1;int x = 63 - Long.numberOfLeadingZeros(n);for (; x >= 0; x--) {ret = ret * ret % mod;if (n << 63 - x < 0) ret = ret * a % mod;}return ret;}public static long totient(long n, int[] primes){long ret = n;for(int p : primes){if((long)p * p > n)break;if(n % p == 0){ret /= p;ret *= p - 1;}while(n % p == 0)n /= p;}if(n != 1){ret /= n;ret *= n - 1;}return ret;}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 G().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)); }}