結果
問題 | No.752 mod数列 |
ユーザー | 37zigen |
提出日時 | 2018-11-09 22:36:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 589 ms / 2,000 ms |
コード長 | 3,118 bytes |
コンパイル時間 | 2,138 ms |
コンパイル使用メモリ | 78,092 KB |
実行使用メモリ | 225,588 KB |
最終ジャッジ日時 | 2024-05-01 05:12:08 |
合計ジャッジ時間 | 17,676 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 295 ms
209,260 KB |
testcase_01 | AC | 294 ms
209,292 KB |
testcase_02 | AC | 305 ms
209,336 KB |
testcase_03 | AC | 296 ms
209,188 KB |
testcase_04 | AC | 301 ms
209,200 KB |
testcase_05 | AC | 295 ms
209,312 KB |
testcase_06 | AC | 300 ms
209,016 KB |
testcase_07 | AC | 293 ms
209,188 KB |
testcase_08 | AC | 299 ms
209,284 KB |
testcase_09 | AC | 302 ms
209,200 KB |
testcase_10 | AC | 309 ms
209,600 KB |
testcase_11 | AC | 306 ms
209,328 KB |
testcase_12 | AC | 309 ms
209,392 KB |
testcase_13 | AC | 312 ms
210,452 KB |
testcase_14 | AC | 309 ms
209,312 KB |
testcase_15 | AC | 439 ms
212,092 KB |
testcase_16 | AC | 448 ms
212,192 KB |
testcase_17 | AC | 589 ms
212,628 KB |
testcase_18 | AC | 463 ms
212,436 KB |
testcase_19 | AC | 507 ms
212,376 KB |
testcase_20 | AC | 464 ms
212,320 KB |
testcase_21 | AC | 479 ms
212,484 KB |
testcase_22 | AC | 463 ms
212,324 KB |
testcase_23 | AC | 478 ms
212,456 KB |
testcase_24 | AC | 482 ms
212,280 KB |
testcase_25 | AC | 454 ms
215,404 KB |
testcase_26 | AC | 575 ms
225,292 KB |
testcase_27 | AC | 547 ms
224,796 KB |
testcase_28 | AC | 576 ms
224,840 KB |
testcase_29 | AC | 581 ms
225,588 KB |
testcase_30 | AC | 487 ms
212,440 KB |
testcase_31 | AC | 292 ms
209,180 KB |
testcase_32 | AC | 298 ms
209,184 KB |
testcase_33 | AC | 305 ms
209,356 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(); long P = sc.nextLong(); int Q = sc.nextInt(); int[] L = new int[Q]; int[] R = new int[Q]; for (int i = 0; i < Q; ++i) { L[i] = sc.nextInt(); R[i] = sc.nextInt(); } PrintWriter pw = new PrintWriter(System.out); long[] sum = new long[20000000]; for (int i = 1; i < sum.length; ++i) { sum[i] = P % i + (i > 0 ? sum[i - 1] : 0); } for (int i = 0; i < Q; ++i) { int l = L[i]; int r = R[i]; long ans = 0; if (l < sum.length) { ans = sum[Math.min(sum.length - 1, r)] - sum[l - 1]; l = Math.min(sum.length, r + 1); } if (l > r) { pw.println(ans); } else { long q = P / l; for (long cur = l; cur <= r;) { long res = P % cur; long x = q == 0 ? r - cur : Math.min((long) ((P - cur * q) / q), r - cur); // l,l+1,..,l+xが商が同じ ans = res * (x + 1) - q * x * (x + 1) / 2 + ans; cur = cur + x + 1; --q; } pw.println(ans); } } pw.close(); } static long gcd(long a, long b) { if (a > b) return gcd(b, a); if (a == 0) return b; return gcd(b % a, a); } static class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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 boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); 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 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() { return (int) nextLong(); } } public static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }