商店页面
EXAPUNKS
全部 讨论 截图 艺术作品 实况直播 视频 创意工坊 新闻 指南 评测
EXAPUNKS >  创意工坊 > Monotof1 的创意工坊
评价数不足
ALPHABETICAL NUMERICAL SORT V2.0
描述 讨论0 留言3 改动说明
   
奖励
收藏
已收藏
取消收藏
文件大小
发表于
更新日期
2.821 KB
2018 年 8 月 26 日 下午 10:37
2018 年 8 月 26 日 下午 11:32
2 项改动说明 （ 查看 ）
创建者
Monotof1
离线
IQuick
离线
767 不重复访客数
297 当前订阅者
4 当前收藏人数

订阅以下载
ALPHABETICAL NUMERICAL SORT V2.0

在 Monotof1 的 1 个合集中
Very good Puzzles and mine
11 件物品
描述
Original Idea and Puzzle by IQuick [ALPHABETICAL NUMERICAL SORT]
I really like the original Puzzle by IQuick and thought it needed a bit more challenge. I modified their version to include requirements for Speed and Efficiency to hopefully discourage brute force solutions. I know this is quite restrictive, but I want people to do more than just go for the easiest approach.
I added a Display, that shows how many times you used #N2KW per Run. It also shows the Testrun with the most uses and that amount. Now you can optimise for another Stat!
warning: if you start at the Testrun with the most uses of #N2KW the display will be inaccurate.
3 条留言
< >
Kalle 2022 年 10 月 11 日 上午 8:33 
Here is my solution:

LINK 800
GRAB 200
LINK -1
REPL SAVER
MARK INC_X
ADDI X 1 X
MODI X 10 T
FJMP MUL
COPY X #N2KW
TEST F > #N2KW
SEEK -1
TJMP INC_X
TEST F = #N2KW
SEEK -1
TJMP FOUND
MARK MUL
SUBI X 1 X
MULI X 10 X
COPY X #N2KW
TEST F = #N2KW
SEEK -1
FJMP INC_X
MARK FOUND
COPY X M
VOID F
COPY 0 X
TEST EOF
FJMP INC_X
COPY 0 M
MARK RECEIVE
COPY M F
JUMP RECEIVE

MARK SAVER
MAKE
MARK SAVE
COPY M T
FJMP SAVE_END
SEEK -9999
COPY T X
MARK NEXT
TEST EOF
TJMP APPEND
TEST X > F
TJMP NEXT
SEEK -1
COPY F T
SEEK -1
COPY X F
COPY T X
JUMP NEXT
MARK APPEND
COPY X F
JUMP SAVE
MARK SAVE_END
SEEK -9999
MARK SND
COPY F #N2KW
COPY #N2KW M
TEST EOF
FJMP SND
WIPE
KILL
GRAB 200
LINK 800
OrdinalChaos 2019 年 5 月 19 日 下午 6:28 
seem to be having a problem were testing for #N2KW < F is giving wrong results, for example when i test 6666 < 32 it says true and we all know that 6666 is not less than 32. anyone else ever have a similar problem?
Vamesix 2018 年 9 月 1 日 上午 12:29 
Really nice puzzle. Took me quite some time to figure it out.