package ycoder; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; /* * このコードでyukicoderの問題である No.781 円周上の格子点の数え上げに提出をしたが、 * TLE(Time Limit Exceed)時間切れになってしまった * もっと効率のいいアルゴリズムを考え直さなければいけない */ public class CircleLatticePoint { public static void main(String... string) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] tmp = br.readLine().split(" "); int rMin = Integer.parseInt(tmp[0]); int rMax = Integer.parseInt(tmp[1]); ArrayList latticePointList = new ArrayList<>(); CircleLatticePoint clp = new CircleLatticePoint(); for(int r = rMin; r <= rMax; r++) { latticePointList.add(clp.getLatticePoint(r)); } latticePointList.stream() .sorted((a,b) -> b - a); int maxLatticePoint = latticePointList.get(0); System.out.println(maxLatticePoint); } public int getLatticePoint(int r) { int result = 0; for(int x = 0; x <= Math.sqrt(r); x++) { for(int y = 0; y < Math.sqrt(r); y++) { if(r == x*x + y*y) { result++; } } } result = result * 4; return result; } }