Submission #43560489

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Threading;
using static CpLibrary.StaticItems;
namespace CpLibrary.Contest
{
	public class SolverD : SolverBase
	{
		Scanner sr;
		bool hasMultipleTestcases = false;

		bool IsLocal { get; set; }

		int[] dx = { 0, 1, 0, -1 };
		int[] dy = { 1, 0, -1, 0 };

		public override void Solve()
		{
			var l = new List<long> { 1, 13 };
			l = Multiply(l, new List<long> { 1, 11 });
			l = Multiply(l, new List<long> { 1, 7 });
			l = Multiply(l, new List<long> { 1, 5, 25 });
			l = Multiply(l, new List<long> { 1, 3, 9 });
			l = Multiply(l, new List<long> { 1, 2, 4, 8, 16, 32, 64 });
			var p = CreateArray(2000, i => true);
			p[0] = false;
			p[1] = false;
			for (int i = 2; i * i < 2000; i++)
			{
				if (!p[i]) continue;
				for (int j = 2 * i; j < 2000; j += i)
				{
					p[j] = false;
				}
			}
			var primes = new List<long>();
			for (int i = 17; i < 2000; i++)
			{
				if (p[i]) primes.Add(i);
				if (primes.Count >= 250) continue;
			}
			primes = Shuffle(primes);
			var a = CreateArray(500, 500, (i, j) => (i + j) % 2 == 0 ? primes[i / 2] * l[j] : 1);
			var s = new HashSet<long>();
			for (int i = 0; i < 500; i++)
			{
				for (int j = 0; j < 500; j++)
				{
					if (a[i][j] > 1)
					{
						s.Add(a[i][j]);
					}
				}
			}
			var max = 0L;
			var maxrep = 0L;
			for (int i = 0; i < 500; i++)
			{
				for (int j = 500 - 1; j >= 0; j--)
				{
					if (a[i][j] == 1)
					{
						for (int k = 0; k < 4; k++)
						{
							var nx = i + dx[k];
							var ny = j + dy[k];
							if (nx < 0) continue;
							if (ny < 0) continue;
							if (nx >= 500) continue;
							if (ny >= 500) continue;
							a[i][j] = LeastCommonMultiple(a[i][j], a[nx][ny]);
						}
						var v = a[i][j];
						while (s.Contains(a[i][j] + 1)) a[i][j] += v;
						maxrep.Chmax(a[i][j] / v);
						a[i][j]++;
						s.Add(a[i][j]);
					}
					max.Chmax(a[i][j]);
				}
			}
			var n = sr.ReadInt();
			for (int i = 0; i < n; i++)
			{
				Console.WriteLine(a[i].Take(n).Join(" "));
			}
			//Console.WriteLine(max);
			//Console.WriteLine(maxrep);
			//s.Clear();
			//for (int i = 0; i < n; i++)
			//{
			//	for (int j = 0; j < n; j++)
			//	{
			//		if (a[i][j] > 1000000000000000L)
			//		{
			//			Console.WriteLine("yabai num");
			//		}
			//		if (i < n - 1)
			//		{
			//			var max = Max(a[i][j], a[i + 1][j]);
			//			var min = Min(a[i][j], a[i + 1][j]);
			//			if (max % min != 1) Console.WriteLine($"yabai tate {a[i][j]} {a[i + 1][j]}");
			//		}
			//		if (j < n - 1)
			//		{
			//			var max = Max(a[i][j], a[i][j + 1]);
			//			var min = Min(a[i][j], a[i][j + 1]);
			//			if (max % min != 1) Console.WriteLine($"yabai yoko {a[i][j]} {a[i][j + 1]}");
			//		}
			//		if (s.Contains(a[i][j])) Console.WriteLine("yabai distinct");
			//		s.Add(a[i][j]);
			//	}
			//}
		}

		public List<long> Shuffle(List<long> a)
		{
			var ret = new long[a.Count].ToList();
			for (int i = 0; i < a.Count / 2; i++)
			{
				ret[2 * i] = a[i];
				ret[a.Count / 2 * 2 - 2 * i - 1] = a[a.Count / 2 + i];
			}
			return ret;
		}

		public long GreatestCommonDivisor(long a, long b)
		{
			if (a < b) return GreatestCommonDivisor(b, a);
			if (a % b == 0) return b;
			return GreatestCommonDivisor(b, a % b);
		}

		public long LeastCommonMultiple(long a, long b) => a / GreatestCommonDivisor(a, b) * b;

		public List<long> Multiply(List<long> a, List<long> b)
		{
			var ret = new List<long>();
			var rev = false;
			for (int i = 0; i < b.Count; i++)
			{
				if (rev)
				{
					for (int j = a.Count - 1; j >= 0; j--)
					{
						ret.Add(a[j] * b[i]);
					}
				}
				else
				{
					for (int j = 0; j < a.Count; j++)
					{
						ret.Add(a[j] * b[i]);
					}
				}
				rev = !rev;
			}
			return ret;
		}

		public void Init()
		{
			/*
			 * Write your init code here if you need!
			 */
		}

		public SolverD(Scanner sr, bool isLocal = false) { this.sr = sr; this.IsLocal = isLocal; }

		public override void Run()
		{
			Init();
			var _t = 1;
			if (hasMultipleTestcases) _t = sr.ReadInt();
			while (_t-- > 0) Solve();
		}
	}

	public static class ProgramD
	{
		private static bool StartsOnThread = true;

		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var sr = new Scanner(new StreamReader(Console.OpenStandardInput()));
			var solver = new SolverD(sr);
			if (StartsOnThread)
			{
				var thread = new Thread(new ThreadStart(() => solver.Run()), 1 << 27);
				thread.Start();
				thread.Join();
			}
			else solver.Run();
			Console.Out.Flush();
		}

		public static void Expand() => SourceExpander.Expander.Expand();
	}
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace CpLibrary { public static class Extention { public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x); public static string Join<T>(this IEnumerable<T> x, char separator) => string.Join(separator, x); public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default); public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default); public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer) { var ng = index - 1; var ok = index + length; while (ok - ng > 1) { var mid = ng + (ok - ng) / 2; var res = comparer.Compare(list[mid], value); if (res < 0 || (isUpperBound && res == 0)) ng = mid; else ok = mid; }  return ok; }  public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T> { if (a.CompareTo(b) >= 0) return false; a = b; return true; }  public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T> { if (a.CompareTo(b) <= 0) return false; a = b; return true; } } }
namespace CpLibrary { public static partial class StaticItems { [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int PopCount(uint n) { n = (n & 0x55555555) + (n >> 1 & 0x55555555); n = (n & 0x33333333) + (n >> 2 & 0x33333333); n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f); n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff); n = (n & 0x0000ffff) + (n >> 16 & 0x0000ffff); return (int)n; }  [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int PopCount(int n) => PopCount((uint)n); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int PopCount(ulong n) { n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555); n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333); n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f); n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff); n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff); n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff); return (int)n; }  [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int PopCount(long n) => PopCount((ulong)n); } }
namespace CpLibrary { public static partial class StaticItems { public static int[] dx4 => new int[]{1, 0, -1, 0}; public static int[] dy4 => new int[]{0, 1, 0, -1}; public static int[] dx8 => new int[]{1, 1, 0, -1, -1, -1, 0, 1}; public static int[] dy8 => new int[]{0, 1, 1, 1, 0, -1, -1, -1}; public enum YesNoOption { Normal, Upper, Lower }  public static bool YesNo(bool condition, YesNoOption option = YesNoOption.Normal) { if (option == YesNoOption.Normal) return YesNoNormal(condition); else if (option == YesNoOption.Upper) return YesNoUpper(condition); else if (option == YesNoOption.Lower) return YesNoLower(condition); else throw new ArgumentException(); }  public static bool YesNoNormal(bool condition) { Console.WriteLine(condition ? "Yes" : "No"); return condition; }  public static bool YesNoUpper(bool condition) { Console.WriteLine(condition ? "YES" : "NO"); return condition; }  public static bool YesNoLower(bool condition) { Console.WriteLine(condition ? "yes" : "no"); return condition; }  public static T SignOutput<T>(int x, T pos, T zero, T neg) => x == 0 ? zero : (x > 0 ? pos : neg); public static T SignOutput<T>(long x, T pos, T zero, T neg) => x == 0 ? zero : (x > 0 ? pos : neg); public static T SignOutput<T>(double x, T pos, T zero, T neg) => x == 0 ? zero : (x > 0 ? pos : neg); public static T[] CreateArray<T>(int n, Func<int, T> func) => Enumerable.Range(0, n).Select(p => func(p)).ToArray(); public static T[][] CreateArray<T>(int x, int y, Func<int, int, T> func) => Enumerable.Range(0, x).Select(i => Enumerable.Range(0, y).Select(j => func(i, j)).ToArray()).ToArray(); public static T[][][] CreateArray<T>(int x, int y, int z, Func<int, int, int, T> func) => Enumerable.Range(0, x).Select(i => Enumerable.Range(0, y).Select(j => Enumerable.Range(0, z).Select(k => func(i, j, k)).ToArray()).ToArray()).ToArray(); } }
namespace CpLibrary { public class Scanner { public StreamReader sr { get; private set; }  string[] str; int index; char[] separators; public Scanner(StreamReader sr, char[] separators) { this.sr = sr; this.separators = separators; str = new string[0]; index = 0; }  public Scanner(StreamReader sr) : this(sr, new char[]{' '}) { }  public Scanner() : this(new StreamReader(Console.OpenStandardInput()), new char[]{' '}) { }  public string Read() { if (index < str.Length) return str[index++]; string s; do s = sr.ReadLine(); while (s == ""); str = s.Split(separators, StringSplitOptions.RemoveEmptyEntries); index = 0; return str[index++]; }  public string ReadString() => Read(); public string[] ReadStringArray(int n) { var arr = new string[n]; for (int i = 0; i < n; i++) { arr[i] = ReadString(); }  return arr; }  public int ReadInt() => int.Parse(ReadString()); public int[] ReadIntArray(int n) => ReadValueArray<int>(n); public long ReadLong() => long.Parse(ReadString()); public long[] ReadLongArray(int n) => ReadValueArray<long>(n); public double ReadDouble() => double.Parse(ReadString()); public double[] ReadDoubleArray(int n) => ReadValueArray<double>(n); public BigInteger ReadBigInteger() => BigInteger.Parse(ReadString()); public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); public (T1, T2) ReadValue<T1, T2>() => (ReadValue<T1>(), ReadValue<T2>()); public (T1, T2, T3) ReadValue<T1, T2, T3>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>()); public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>()); public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>()); public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>(), ReadValue<T6>()); public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>(), ReadValue<T6>(), ReadValue<T7>()); public T1[] ReadValueArray<T1>(int n) { var arr = new T1[n]; for (int i = 0; i < n; i++) { arr[i] = ReadValue<T1>(); }  return arr; }  public (T1[], T2[]) ReadValueArray<T1, T2>(int n) { var(v1, v2) = (new T1[n], new T2[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i]) = ReadValue<T1, T2>(); }  return (v1, v2); }  public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int n) { var(v1, v2, v3) = (new T1[n], new T2[n], new T3[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i]) = ReadValue<T1, T2, T3>(); }  return (v1, v2, v3); }  public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int n) { var(v1, v2, v3, v4) = (new T1[n], new T2[n], new T3[n], new T4[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i]) = ReadValue<T1, T2, T3, T4>(); }  return (v1, v2, v3, v4); }  public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int n) { var(v1, v2, v3, v4, v5) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i]) = ReadValue<T1, T2, T3, T4, T5>(); }  return (v1, v2, v3, v4, v5); }  public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int n) { var(v1, v2, v3, v4, v5, v6) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i]) = ReadValue<T1, T2, T3, T4, T5, T6>(); }  return (v1, v2, v3, v4, v5, v6); }  public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int n) { var(v1, v2, v3, v4, v5, v6, v7) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n], new T7[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i], v7[i]) = ReadValue<T1, T2, T3, T4, T5, T6, T7>(); }  return (v1, v2, v3, v4, v5, v6, v7); }  public (T1, T2)[] ReadTupleArray<T1, T2>(int n) { var ret = new (T1, T2)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2>(); }  return ret; }  public (T1, T2, T3)[] ReadTupleArray<T1, T2, T3>(int n) { var ret = new (T1, T2, T3)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2, T3>(); }  return ret; }  public (T1, T2, T3, T4)[] ReadTupleArray<T1, T2, T3, T4>(int n) { var ret = new (T1, T2, T3, T4)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2, T3, T4>(); }  return ret; }  public (T1, T2, T3, T4, T5)[] ReadTupleArray<T1, T2, T3, T4, T5>(int n) { var ret = new (T1, T2, T3, T4, T5)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2, T3, T4, T5>(); }  return ret; }  public (T1, T2, T3, T4, T5, T6)[] ReadTupleArray<T1, T2, T3, T4, T5, T6>(int n) { var ret = new (T1, T2, T3, T4, T5, T6)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2, T3, T4, T5, T6>(); }  return ret; }  public (T1, T2, T3, T4, T5, T6, T7)[] ReadTupleArray<T1, T2, T3, T4, T5, T6, T7>(int n) { var ret = new (T1, T2, T3, T4, T5, T6, T7)[n]; for (int i = 0; i < n; i++) { ret[i] = ReadValue<T1, T2, T3, T4, T5, T6, T7>(); }  return ret; } } }
namespace CpLibrary { public interface ISolver { public void Solve(); public void Run(); }  public abstract class SolverBase : ISolver { public abstract void Solve(); public abstract void Run(); } }
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander

Submission Info

Judge Result