Here\'s a function to calculate the digital sum of a number in J: digitalSum =: +/@:(\".\"0)@\": If I use b. to query the rank of this verb, I get _ 1 _, i.e., infinite. (We can ignore the dyadic ca
I\'m currently learning the fascinating J programming lan开发者_Python百科guage, but one thing I have not been able to figure out is how to filter a list.
I just downloaded the Haskell and J modes off of SourceForge, and I\'m having trouble figuring out how to make them interface with emacs 23. Google searches yield detailed instructions for emacs 22, b
Let\'s say I have the following J expression: # 3 ((|=0:)#]) 1+i.1000 This counts the number of numbers between 1 and 1000 that are evenly divisible by 3. (Now, before anyone points out that there\'
I\'ve been using J for a few months now, and I find that reading unfamiliar code (e.g. that I didn\'t write myself) is one of the most challenging aspects of the language, particularly when it\'s in t
Here is a different approach for the Project Euler #1 solution: +/~.(3*i.>.1000%3),5*i.>.1000开发者_如何学运维%5
加载中,请稍侯......