Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

verify #52
Log
Raw
FAILED n11.txt holds 10 points: a file named n11.txt must hold exactly 11, one `x y` a line n11.txt holds 10 points: a file named n11.txt must hold exactly 11, one `x y` a line
Resources--partition=main --time=00:05:00 --cpus-per-task=1 --mem=1024M
Submit directory(the project root)
Approved versiona1dc214
Resultn11.txt holds 10 points: a file named n11.txt must hold exactly 11, one `x y` a line
Batch script
#!/bin/bash #SBATCH --job-name=verify #SBATCH --time=5:00 # Judge the configurations in the pushed route's folder with the approved verify.py, in exact arithmetic. python3 verify.py "$SS_INPUT/$SS_ROUTE_DIR"