Heilbronn's triangle problem: record configurations
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
作业
批处理脚本,和 Slurm 集群上一样:先推送,再在你的克隆里运行 sbatch job.sbatch。分区:main(最长 01:00:00,4 个 CPU)。
还没有运行器服务这个项目。