結果

問題 No.1143 面積Nの三角形
ユーザー uwiuwi
提出日時 2020-07-31 22:39:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 537 ms / 800 ms
コード長 4,061 bytes
コンパイル時間 4,283 ms
コンパイル使用メモリ 80,172 KB
実行使用メモリ 52,828 KB
最終ジャッジ日時 2023-09-21 01:12:28
合計ジャッジ時間 8,489 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,428 KB
testcase_01 AC 43 ms
49,396 KB
testcase_02 AC 42 ms
49,356 KB
testcase_03 AC 44 ms
49,244 KB
testcase_04 AC 43 ms
49,464 KB
testcase_05 AC 42 ms
49,736 KB
testcase_06 AC 44 ms
49,432 KB
testcase_07 AC 86 ms
52,648 KB
testcase_08 AC 80 ms
52,384 KB
testcase_09 AC 116 ms
52,828 KB
testcase_10 AC 77 ms
52,472 KB
testcase_11 AC 266 ms
52,444 KB
testcase_12 AC 319 ms
52,292 KB
testcase_13 AC 334 ms
52,252 KB
testcase_14 AC 67 ms
50,344 KB
testcase_15 AC 43 ms
49,396 KB
testcase_16 AC 527 ms
52,440 KB
testcase_17 AC 537 ms
52,392 KB
testcase_18 AC 428 ms
52,380 KB
testcase_19 AC 427 ms
52,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200731;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long N = nl();
		int ans = 0;
		
		long S = N*N;
		
		long[] ds = new long[10000];
		int p = 0;
		for(long d = 1;d*d <= S;d++) {
			if(S % d == 0) {
				ds[p++] = d;
				if(S/d < d)ds[p++] = S/d;
			}
		}
		
		ds = Arrays.copyOf(ds, p);
		Arrays.sort(ds);
		
		for(int ai = 0;ai < p;ai++) {
			long A = ds[ai];
			for(int bi = 0;bi < ai && ds[ai] * ds[bi] * ds[bi] * ds[bi] <= S;bi++) {
				long B = ds[bi];
				if(S % (A*B) == 0) {
					for(int ci = bi;ci < ai && ds[ai] * ds[bi] * ds[ci] * ds[ci] <= S;ci++) {
						long C = ds[ci];
						if(S % (A*B*C) == 0) {
							long D = S/A/B/C;
							if(C <= D && D < A) {
								long c = (A-B);
								long b = (A-C);
								long a = (A-D);
								if(a+b+c == 2*A) {
									ans++;
								}
							}
						}
					}
				}
			}
		}
		out.println(ans);
	}
	
	
	
	public static int gcd(int a, int b) {
		while (b > 0) {
			int c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E3().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0