結果
| 問題 | No.1200 お菓子配り-3 |
| ユーザー |
 hiromi_ayase
|
| 提出日時 | 2020-08-28 22:28:34 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,429 bytes |
| コンパイル時間 | 2,827 ms |
| コンパイル使用メモリ | 90,792 KB |
| 実行使用メモリ | 71,620 KB |
| 最終ジャッジ日時 | 2024-11-14 15:46:21 |
| 合計ジャッジ時間 | 20,131 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 29 WA * 2 |
ソースコード
import java.util.Arrays;public class Main {private static void solve() {int s = ni();int[] primes = sieveEratosthenes(1000000);for (int i = 0; i < s; i++) {int x = ni();int y = ni();if (x < y) {int tmp = x;x = y;y = tmp;}// x >= y// ab + c = x// ac + b = y// (a+1)(b+c) = x+y// (a-1)(b-c) = x-y// b+c = (x+y)/(a+1)// b-c = (x-y)/(a-1)int p = x + y;int q = x - y;int ret = 0;for (int v1 : divisors(p, primes)) {for (int v2 : divisors(q, primes)) {if (v1 - 1 == v2 + 1 && p / v1 % 2 == q / v2 % 2) {int a = v1 - 1;int b = ((p / v1) + (q / v2)) / 2;int c = ((p / v1) - (q / v2)) / 2;if (a > 0 && b > 0 && c > 0) {ret++;}}}}out.println(ret);}}public static int[] divisors(int n, int[] primes) {int[] div = new int[1600];div[0] = 1;int r = 1;for (int p : primes) {if (p * p > n)break;int i;for (i = 0; n % p == 0; n /= p, i++);if (i > 0) {for (int j = r - 1; j >= 0; j--) {int base = div[j];for (int k = 0; k < i; k++) {base *= p;div[r++] = base;}}}}if (n != 1) {for (int j = r - 1; j >= 0; j--) {div[r++] = div[j] * n;}}return Arrays.copyOf(div, r);}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;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 void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic void run() {long start = System.currentTimeMillis();String debug = args.length > 0 ? args[0] : null;if (debug != null) {try {is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));} catch (Exception e) {throw new RuntimeException(e);}}reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);solve();out.flush();tr((System.currentTimeMillis() - start) + "ms");}}, "", 64000000).start();}private static java.io.InputStream is = System.in;private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);private static java.util.StringTokenizer tokenizer = null;private static java.io.BufferedReader reader;public static String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new java.util.StringTokenizer(reader.readLine());} catch (Exception e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}private static double nd() {return Double.parseDouble(next());}private static long nl() {return Long.parseLong(next());}private static int[] na(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = ni();return a;}private static char[] ns() {return next().toCharArray();}private static long[] nal(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nl();return a;}private static int[][] ntable(int n, int m) {int[][] table = new int[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[i][j] = ni();}}return table;}private static int[][] nlist(int n, int m) {int[][] table = new int[m][n];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[j][i] = ni();}}return table;}private static int ni() {return Integer.parseInt(next());}private static void tr(Object... o) {if (is != System.in)System.out.println(java.util.Arrays.deepToString(o));}}