Cody

James

5
Rank
16
Badges
22500
Score

Activities

1 – 50 of 3,059

James submitted a Comment to Solution 196399

To paraphrase Arthur C Clarke: "Any sufficiently advanced Cody solution from Alfonso is indistinguishable from magic."

on 22 Sep 2016 at 13:26

James submitted Solution 979076 to Problem 42985. Vector multiplication

on 21 Sep 2016 at 18:41

James submitted a Comment to Problem 42915. How Far Can You Throw Something?

I prefer the term "cyborg," goc3. By the way, have you seen Sarah Connor anywhere? I've been looking for her...

on 21 Sep 2016 at 16:30

James submitted Solution 977482 to Problem 42992. S-T-R-E-T-C-H I-T O-U-T

on 20 Sep 2016 at 17:09

James submitted Problem 42992. S-T-R-E-T-C-H I-T O-U-T to Community

on 20 Sep 2016 at 17:09

James submitted Solution 970829 to Problem 42955. list of prime numbers

on 15 Sep 2016 at 17:55

James submitted Solution 970828 to Problem 42954. Find subtraction

on 15 Sep 2016 at 17:55

James submitted Solution 970827 to Problem 42954. Find subtraction

on 15 Sep 2016 at 17:54

James submitted Solution 970825 to Problem 42951. find lenth of array

on 15 Sep 2016 at 17:54

James submitted Solution 970389 to Problem 42950. first element of matrix

on 15 Sep 2016 at 12:51

James submitted Solution 970378 to Problem 42946. Find mean

on 15 Sep 2016 at 12:44

James submitted a Comment to Solution 952060

I guess this is one of those times where saving the intermediate steps doesn't help your computation time. Nicely done. As a comparison, using mod(b,2) takes about two-thirds longer than 2*floor(b/2) on my machine; 18.8 sec vs 11.3 sec for n=1e8, and 38 sec vs 23 sec for 2e8. That's good to know for speeding things up in other codes I need to run millions of times!

on 13 Sep 2016 at 18:08

James submitted Solution 967003 to Problem 42934. Log of a number

on 13 Sep 2016 at 17:33

James submitted Solution 967000 to Problem 42931. Square root of a number

on 13 Sep 2016 at 17:31

James submitted Solution 966999 to Problem 42930. Unit conversion

on 13 Sep 2016 at 17:31

James submitted Solution 966998 to Problem 42929. Annual Salary

on 13 Sep 2016 at 17:30

James submitted Solution 966996 to Problem 42928. Area of a circle

on 13 Sep 2016 at 17:30

James submitted Solution 966994 to Problem 42926. ASCII code of a leter.

on 13 Sep 2016 at 17:29

James submitted Solution 961194 to Problem 42977. Prime number removal

on 6 Sep 2016 at 18:51

James submitted Solution 956901 to Problem 42976. iteration of N blank spot

on 2 Sep 2016 at 17:24

James submitted Solution 956875 to Problem 42944. find minimum

on 2 Sep 2016 at 17:17

James submitted Solution 956872 to Problem 42943. find max

on 2 Sep 2016 at 17:17

James submitted Solution 956870 to Problem 42941. Halder function

on 2 Sep 2016 at 17:16

James submitted Solution 956849 to Problem 42940. modulus of a number

on 2 Sep 2016 at 17:13

James submitted a Comment to Solution 946183

I did the same thing, minus the uint64. My Project Euler code timed out on the 1e7 and 1e8 test cases.

on 31 Aug 2016 at 19:24

James submitted a Comment to Problem 42936. Project Euler: Problem 11, Largest product in a grid

Just submitted my solution (slightly modified from the original Project Euler problem! :-), and the values do not wrap around in any direction.

on 31 Aug 2016 at 17:43

James submitted a Comment to Problem 42936. Project Euler: Problem 11, Largest product in a grid

Since I can't tell from the test suite, do you wrap around the matrix when you are calculating the products? For example, when doing the products of four consecutive numbers in the up/down direction, do you do rows 1:4, 2:5, 3:6, 4:7...7:10 and stop there, or do you include the row combinations [8:10 1], [9:10 1:2] and [10 1:3]?

on 31 Aug 2016 at 13:40

James submitted a Comment to Solution 946821

Thanks. I coded that solution up LONG before movmax became a thing...

on 31 Aug 2016 at 12:01

1 – 50 of 3,059