Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 39174

The challenge involves mathematics. Also consider using more specific tags: [number] [number-theory] [arithmetic] [combinatorics] [graph-theory] [geometry] [abstract-algebra].

7
votes
Mathematica, 30 bytes Tr@Mod[Differences@#2,#,-#/2]& This is an anonymous function which takes two arguments. Example usage: Tr@Mod[Differences@#2,#,-#/2]&[3, {0, 1, 2, 2, 0, 1, 0, 2, 1, 2, 0, 1, …
answered May 13 '15 by 2012rcampion
3
votes
AVR (274 bytes, 0 energy points) With all those fancy high-level languages you're never really sure how much RAM you're accessing. The only way to be sure is to nuke it from orbit go down to the byt …
answered Apr 13 '15 by 2012rcampion
3
votes
Mathematica, 39,994,961,721,988 (10^13.60) A simple simulated annealing optimization method; no optimization or tuning yet. n = 30; current = -\[Infinity]; best = -\[Infinity]; saved = ConstantArray …
answered Jul 16 '15 by 2012rcampion
2
votes
Mathematica, 253 216 bytes (214 chars) r=RegularExpression;c=ToCharacterCode;f=SortBy[Tr@Flatten@Reap[StringCases[#, {r@"(\\bR.*)+"->∞,r@"\\d+":>0Sow@-FromDigits@"$0",r@"[a-z]":>c@"$0"-96, r@"[A-Z]": …
answered Oct 6 '15 by 2012rcampion