結果

問題 No.781 円周上の格子点の数え上げ
ユーザー OlandOland
提出日時 2019-07-24 18:17:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 248 ms / 2,000 ms
コード長 4,253 bytes
コンパイル時間 2,275 ms
コンパイル使用メモリ 81,392 KB
実行使用メモリ 117,508 KB
最終ジャッジ日時 2024-06-28 02:08:37
合計ジャッジ時間 5,026 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,068 KB
testcase_01 AC 53 ms
37,056 KB
testcase_02 AC 54 ms
36,848 KB
testcase_03 AC 54 ms
37,120 KB
testcase_04 AC 51 ms
36,832 KB
testcase_05 AC 50 ms
37,288 KB
testcase_06 AC 54 ms
37,236 KB
testcase_07 AC 56 ms
37,852 KB
testcase_08 AC 150 ms
117,272 KB
testcase_09 AC 137 ms
117,460 KB
testcase_10 AC 52 ms
37,200 KB
testcase_11 AC 56 ms
37,580 KB
testcase_12 AC 189 ms
117,296 KB
testcase_13 AC 248 ms
117,508 KB
testcase_14 AC 69 ms
42,284 KB
testcase_15 AC 53 ms
37,556 KB
testcase_16 AC 53 ms
37,304 KB
testcase_17 AC 172 ms
85,432 KB
testcase_18 AC 115 ms
85,336 KB
testcase_19 AC 116 ms
86,852 KB
testcase_20 AC 116 ms
86,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Map.Entry;
import java.util.function.Function;
import java.util.stream.Collectors;

@SuppressWarnings("unused")
public class Main {
	FastScanner in = new FastScanner(System.in);
	PrintWriter out = new PrintWriter(System.out);
	final int MOD = (int)1e9+7;
	void printlnYN(boolean b){out.println((b ? "YES" : "NO"));}

	//System.out.println();はつかわない！！
	void solve() throws Exception{
		int minR = in.nextInt(), maxR = in.nextInt();
		long ans = 0;
		long[] num = new long[maxR+1];
		for(long x = 0; x * x <= maxR; x++){
			for(long y = x; y * y <= maxR; y++){
				int r = (int)(x * x + y * y);
				int cnt = 8;
				if(x == 0) cnt /= 2;
				if(y == 0) cnt /= 2;
				if(x == y) cnt /= 2;
				if(r >= minR && r <= maxR){
					num[r] += cnt;
					ans = Math.max(ans, num[r]);
				}
			}
		}
		out.println(ans);
	}
	
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		solve();
		out.flush();
	}
	
	class FastScanner {
		Reader input;

		FastScanner() {this(System.in);}
		FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
		
		int nextInt() {return (int) nextLong();}

		long nextLong() {
			try {
				int sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				long ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) return ret * sign;
					ret *= 10;
					ret += b - '0';
				}
			} catch (IOException e) {
				e.printStackTrace();
				return -1;
			}
		}

		double nextDouble() {
			try {
				double sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				double ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) break;
					ret *= 10;
					ret += b - '0';
				}
				if (b != '.') return sign * ret;
				double div = 1;
				b = input.read();
				while ('0' <= b && b <= '9') {
					ret *= 10;
					ret += b - '0';
					div *= 10;
					b = input.read();
				}
				return sign * ret / div;
			} catch (IOException e) {
				e.printStackTrace();
				return Double.NaN;
			}
		}

		char nextChar() {
			try {
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				return (char) b;
			} catch (IOException e) {
				e.printStackTrace();
				return 0;
			}
		}

		String nextStr() {
			try {
				StringBuilder sb = new StringBuilder();
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				while (b != -1 && !Character.isWhitespace(b)) {
					sb.append((char) b);
					b = input.read();
				}
				return sb.toString();
			} catch (IOException e) {
				e.printStackTrace();
				return "";
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}
 
		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}
 
		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}
 
		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}
 
		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}
 
		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}
 
		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}
	}
}
/* end Main */
0