結果

問題 No.1318 ABCD quadruplets
コンテスト
ユーザー 紙ぺーぱー
提出日時 2020-12-15 00:29:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,613 ms / 2,000 ms
コード長 4,253 bytes
コンパイル時間 3,159 ms
コンパイル使用メモリ 117,624 KB
実行使用メモリ 34,260 KB
最終ジャッジ日時 2024-09-20 01:04:45
合計ジャッジ時間 16,734 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using static System.Math;
using static Program.IO.Scanner;
using Number = System.Int64;
using System.Numerics;
// using C = System.Int32;
#region IO
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}
	static public class Scanner {
		public static StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
		public static int ri => sc.Integer();
		public static long rl => sc.Long();
		public static string rs => sc.Scan();
		public static double rd => sc.Double();
	}
	public class StreamScanner {
		public StreamScanner(Stream stream) { str = stream; }

		public readonly Stream str;
		private readonly byte[] buf = new byte[1024];
		private int len, ptr;
		public bool isEof = false;
		public bool IsEndOfStream { get { return isEof; } }

		private byte read() {
			if (isEof) return 0;
			if (ptr >= len) {
				ptr = 0;
				if ((len = str.Read(buf, 0, 1024)) <= 0) {
					isEof = true;
					return 0;
				}
			}
			return buf[ptr++];
		}

		public char Char() {
			byte b = 0;
			do b = read(); while ((b < 33 || 126 < b) && !isEof);
			return (char)b;
		}
		public string Scan() {
			var sb = new StringBuilder();
			for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
			return sb.ToString();
		}
		public string ScanLine() {
			var sb = new StringBuilder();
			for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}

}

#endregion

#region main
static class Ex {
	static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}

	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
		var solver = new Program.Solver();
		var t = new System.Threading.Thread(solver.Solve, 50000000);
		t.Start();
		t.Join();
		//*/
		// solver.Solve();
		Console.Out.Flush();
	}
}
#endregion

namespace Program {
	public class Solver {
		Random rnd = new Random(0);
		public void Solve() {
			var n = ri;
			var m = ri;
			var ans = new long[n + 5];
			var cnt = new int[n + 5];
			var coef = 4 * 3 * 2 * 1;
			Action<int> inc = x => {
				cnt[x]++;
				coef /= cnt[x];
			};
			Action<int> dec = x => {
				coef *= cnt[x];
				cnt[x]--;
			};
			for (int i = 0; i <= m; i++) {
				var a = i * i;
				if (a > n) break;
				inc(i);
				for (int j = i; j <= m; j++) {
					var b = a + j * (i + j);
					if (b > n) break;
					inc(j);
					for (int k = j; k <= m; k++) {
						var c = b + k * (i + j + k);
						if (c > n) break;
						inc(k);
						for (int l = k; l <= m; l++) {
							var d = c + l * (i + j + k + l);
							if (d > n) break;
							inc(l);
							Debug.WriteLine($"{i} {j} {k} {l} {d} {coef}");
							ans[d] += coef;
							dec(l);

						}
						dec(k);
					}
					dec(j);
				}
				dec(i);
			}
			for (int i = 0; i <= n; i++)
				Console.WriteLine(ans[i]);
		}
		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		static T[] Enumerate<T>(int n, Func<int, T> f) {
			var a = new T[n]; for (int i = 0; i < a.Length; ++i) a[i] = f(i); return a;
		}
		static T[][] Enumerate<T>(int n, int m, Func<int, int, T> f) {
			return Enumerate(n, x => Enumerate(m, y => f(x, y)));
		}
		static T[][][] Enumerate<T>(int n, int m, int k, Func<int, int, int, T> f) {
			return Enumerate(n, x => Enumerate(m, k, (y, z) => f(x, y, z)));
		}
		static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
	}
}
0