結果

問題 No.752 mod数列
ユーザー 37zigen37zigen
提出日時 2018-11-09 22:36:01
言語 Java19
(openjdk 19.0.1)
結果
AC  
実行時間 715 ms / 2,000 ms
コード長 3,118 bytes
コンパイル時間 2,140 ms
実行使用メモリ 205,820 KB
最終ジャッジ日時 2022-12-26 20:28:40
合計ジャッジ時間 22,511 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 401 ms
192,484 KB
testcase_01 AC 393 ms
192,536 KB
testcase_02 AC 390 ms
192,608 KB
testcase_03 AC 391 ms
192,544 KB
testcase_04 AC 391 ms
192,444 KB
testcase_05 AC 393 ms
192,636 KB
testcase_06 AC 396 ms
192,584 KB
testcase_07 AC 393 ms
192,552 KB
testcase_08 AC 394 ms
192,544 KB
testcase_09 AC 394 ms
192,588 KB
testcase_10 AC 409 ms
192,692 KB
testcase_11 AC 409 ms
192,564 KB
testcase_12 AC 410 ms
192,528 KB
testcase_13 AC 407 ms
192,696 KB
testcase_14 AC 412 ms
192,568 KB
testcase_15 AC 543 ms
198,512 KB
testcase_16 AC 573 ms
199,172 KB
testcase_17 AC 715 ms
198,336 KB
testcase_18 AC 581 ms
200,084 KB
testcase_19 AC 611 ms
199,960 KB
testcase_20 AC 609 ms
200,056 KB
testcase_21 AC 605 ms
199,868 KB
testcase_22 AC 595 ms
200,028 KB
testcase_23 AC 609 ms
200,156 KB
testcase_24 AC 597 ms
200,216 KB
testcase_25 AC 550 ms
197,540 KB
testcase_26 AC 662 ms
204,896 KB
testcase_27 AC 623 ms
203,872 KB
testcase_28 AC 656 ms
204,596 KB
testcase_29 AC 678 ms
205,820 KB
testcase_30 AC 611 ms
200,824 KB
testcase_31 AC 394 ms
192,568 KB
testcase_32 AC 395 ms
192,544 KB
testcase_33 AC 394 ms
192,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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));
	}
}
0