#369635 (D) No.864 四方演算

• 問題: No.864 四方演算
• ユーザー: daut-dlang
• 提出日時: 2019-08-16 22:55:24
• 言語: D (dmd 2.106.1)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,815 bytes
• コンパイル時間: 801 ms
• コンパイル使用メモリ: 110,820 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 02:20:32
• 合計ジャッジ時間: 1,614 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	8 ms; 6,940 KB
testcase_03	AC	9 ms; 6,940 KB
testcase_04	AC	9 ms; 6,944 KB
testcase_05	AC	7 ms; 6,944 KB
testcase_06	AC	10 ms; 6,940 KB
testcase_07	AC	9 ms; 6,940 KB
testcase_08	AC	8 ms; 6,940 KB
testcase_09	AC	5 ms; 6,940 KB
testcase_10	AC	4 ms; 6,940 KB
testcase_11	AC	3 ms; 6,940 KB
testcase_12	AC	8 ms; 6,940 KB
testcase_13	AC	6 ms; 6,940 KB
testcase_14	AC	3 ms; 6,940 KB
testcase_15	AC	11 ms; 6,944 KB
testcase_16	AC	9 ms; 6,944 KB
testcase_17	AC	10 ms; 6,940 KB
testcase_18	AC	8 ms; 6,944 KB
testcase_19	AC	7 ms; 6,940 KB
testcase_20	AC	10 ms; 6,940 KB
testcase_21	AC	8 ms; 6,940 KB
testcase_22	AC	8 ms; 6,944 KB
testcase_23	AC	2 ms; 6,940 KB
testcase_24	AC	7 ms; 6,940 KB
testcase_25	AC	4 ms; 6,940 KB
testcase_26	AC	7 ms; 6,944 KB
testcase_27	AC	1 ms; 6,944 KB
testcase_28	AC	1 ms; 6,944 KB
testcase_29	AC	1 ms; 6,940 KB

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto K = RD;
	long ans;
	for (long i = 2; i*i <= K; ++i)
	{
		if (K % i != 0) continue;
		if (i > N*2) continue;
		auto j = K / i;
		if (j > N*2) continue;
		auto pat1 = i-1 <= N ? i-1 : N - (i - N) + 1;
		auto pat2 = j-1 <= N ? j-1 : N - (j - N) + 1;
		ans += pat1 * pat2 * 2;
		debug writeln(i, ":", j, " ", pat1, ":", pat2, " ", ans);
	}
	writeln(ans);
	stdout.flush();
	debug readln();
}