結果

問題 No.781 円周上の格子点の数え上げ
ユーザー holegumaholeguma
提出日時 2019-07-17 21:45:40
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,389 bytes
コンパイル時間 2,098 ms
コンパイル使用メモリ 78,840 KB
実行使用メモリ 93,160 KB
最終ジャッジ日時 2024-06-02 12:20:54
合計ジャッジ時間 6,095 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 158 ms
78,556 KB
testcase_02 AC 148 ms
78,376 KB
testcase_03 WA -
testcase_04 AC 144 ms
78,412 KB
testcase_05 WA -
testcase_06 AC 143 ms
78,456 KB
testcase_07 AC 161 ms
78,556 KB
testcase_08 AC 139 ms
78,476 KB
testcase_09 AC 145 ms
78,552 KB
testcase_10 AC 144 ms
78,576 KB
testcase_11 AC 149 ms
78,556 KB
testcase_12 AC 152 ms
78,476 KB
testcase_13 AC 171 ms
78,464 KB
testcase_14 AC 157 ms
78,504 KB
testcase_15 AC 147 ms
78,540 KB
testcase_16 AC 149 ms
78,528 KB
testcase_17 AC 147 ms
78,456 KB
testcase_18 AC 141 ms
78,264 KB
testcase_19 AC 161 ms
78,412 KB
testcase_20 AC 151 ms
78,540 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int x = ir.nextInt();
		int y = ir.nextInt();
		int[] ct = new int[10000001];
		for (int i = 0; i <= Math.sqrt(1e7); i++) {
			for (int j = 0; j <= Math.sqrt(1e7); j++) {
				if (i * i + j * j > (int) 1e7)
					break;
				ct[i * i + j * j]++;
			}
		}
		int ma = 0;
		for (int i = x; i <= y; i++)
			ma = Math.max(ma, ct[i]);
		out.println(ma * 4);
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		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 char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}
0