Liam Mueller StandoffVenus
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "io" | |
| "bytes" | |
| "fmt" | |
| ) | |
| type PlainBitReader struct { | |
| reader io.ByteReader |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package Village | |
| type Acceptor struct { | |
| Name string | |
| preferences map[*Proposer]int | |
| Free bool | |
| partner *Proposer | |
| proposalPool []*Proposer | |
| } |
StandoffVenus
/ FzzBuzz.py
Last active
March 16, 2017 22:42
Given the Fizz Buzz challenge, create code to handle large integer input (= no recursion) that avoids the use of "i" and dynamic code functions (e.g. eval, exec, etc.)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # gets our global methods (such as reduce or eval - though, eval's not used here) | |
| gb = vars(globals()['__bu' + chr(105) + 'lt' + chr(105) + 'ns__']) | |
| nput = gb[chr(105) + 'nput'] | |
| prnt = gb['pr' + chr(105) + 'nt'] | |
| nt = gb[chr(105) + 'nt'] | |
| # _mport functools -> make to d_ct -> get reduce() from module | |
| reduce = vars(gb['__' + chr(105) + 'mport__']('functools'))['reduce'] |