flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
Spool
[ Post removed by author. ]
Last edited by Spool on 17 Mar 2013, 10:42; edited 1 time in total |
|||
![]() |
|
KevinN
|
|||
![]() |
|
typedef
|
|||
![]() |
|
Dex4u
We used to have a fasm compo
http://board.flatassembler.net/topic.php?t=2164 Entrys http://board.flatassembler.net/topic.php?p=98270#98270 Note: i was called Ashley4 then. |
|||
![]() |
|
bitRAKE
There are contests out there...
http://azspcs.net/Contest/Factorials/Standings (seems I've slipped to rank 65) ...just apply FASM where needed. |
|||
![]() |
|
hopcode
bitRAKE wrote: (seems I've slipped to rank 65) because you start counting at 0 ![]() welcome back, i missed you a lot all this time. Cheers, ![]() _________________ ⠓⠕⠏⠉⠕⠙⠑ |
|||
![]() |
|
bitRAKE
Thank you for the kind words hopcode. By the looks of your work, you have been busier than I.
![]() |
|||
![]() |
|
bitRAKE
Here is another contest which would be challenging for assembly programmers - Linux environment competing against HLLs.
http://en.wikipedia.org/wiki/ICFP_Programming_Contest |
|||
![]() |
|
revolution
KevinN wrote: ... wins some given amount of money designated by sponsor. |
|||
![]() |
|
nmake
The winners reserve "bragging rights" to claim that their language is "the programming tool of choice for discriminating hackers"
Reserve the bragging rights among the participants, not on a global scale. Important and relevant distinction. ![]() |
|||
![]() |
|
sleepsleep
bitRAKE wrote: There are contests out there... i dont understand the question. wat is that? 1, 2, 3, 6, -5, -30, 150, 120 |
|||
![]() |
|
comrade
From EFnet #asm (back in the day)
http://www.haxor.me.uk/asmcompo/ My best entry was in compo #6 (second place). Funny enough 1st place winner was written in C ![]() |
|||
![]() |
|
bitRAKE
sleepsleep, from the website:
Quote: The Task Algorithm choice is very important. I started out with brute forcing at 13! and then moved to a random sort-of divide-and-conquer approach. It was fast at getting valid SLPs. Noticed some patterns in optimal solutions, and tried to solve a reduced form of the problem. There are just so many approaches that aren't efficient enough... Here are some additional SLPs: (Not part of the solution, 1! through 12!) Code: 1 1, 2 1, 2, 3, 6 1, 2, 4, 6, 24 1, 2, 3, 5, 8, 24, 120 1, 2, 3, 9, 81, 80, 720 1, 2, 3, 6, 36, 72, 70, 5040 1, 2, 3, 6, 36, 35, 32, 1152, 40320 1, 2, 3, 6, 36, 72, 70, 5040, 362880 1, 2, 3, 5, 7, 12, 144, 720, 5040, 3628800 1, 2, 3, 9, 81, 80, 77, 6160, 492800, 39916800 1, 2, 4, 8, 12, 144, 152, 23104, 23100, 3326400, 479001600 |
|||
![]() |
|
bitRAKE
New contest up at:
http://azspcs.com/Contest/Tetrahedra Solutions are easy - good solutions are harder. (Currently, I'm ranked 63, or 18th in USA.) Kind regards, dear friends. |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.