1〜Nの整数を集合Aと集合Bに分け、各集合の平方根の和を求める際、2つの和が最も近くなるときの集合Aと集合Bを求めるへなちょこ独自アルゴリズム計算システム https://kspace-trk.github.io/floyd-01/
-
Notifications
You must be signed in to change notification settings - Fork 0
kspace-trk/floyd-01
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
1〜Nの整数を集合Aと集合Bに分け、各集合の平方根の和を求める際、2つの和が最も近くなるときの集合Aと集合Bを求めるへなちょこ独自アルゴリズム計算システム
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published