Cody

# Recent Activity

1 – 50 of 9,887
 Christian Schröder submitted a Comment to Problem 44967. Hello Good problem, but a duplicate of problem 44384. 9 hours and 21 minutes ago Oh 14 hours and 4 minutes ago Good one on 17 Sep 2019 at 16:41 Simon Thomas submitted a Comment to Solution 1939228 Happier now. Loop though nList handled in test suite. No loop in my function and returns the 2 primes closest together on 17 Sep 2019 at 10:29 Simon Thomas submitted a Comment to Solution 1939224 given that the looping through nList is handled in the test suite, I don't need to. on 17 Sep 2019 at 10:11 No, that test suite is fine, since he uses those random values to calculate y_correct. Also, for that other test with 3>7, he's using that to create a false logical value for y_correct. on 16 Sep 2019 at 12:37 The test suite should be working now. I fixed the parentheses problem mentioned in the other comments (it should now recognize left and right parentheses as different). There were also seven spaces between words in the test suite, though the encoded description indicated five—that has been fixed, as well. on 16 Sep 2019 at 12:31 hay on 14 Sep 2019 at 13:08 Lohendran letchmanan submitted a Comment to Solution 1935707 its hard on 14 Sep 2019 at 9:38 ... submitted a Comment to Solution 1935431 good on 14 Sep 2019 at 4:58 vecsum doesn't work in my 2018b software and I can't find vecsum in my documentation. Where is it? on 13 Sep 2019 at 16:36 Richa Singh submitted a Comment to Solution 1934272 What exactly the error is on 13 Sep 2019 at 9:09 Abuzar Qureshi submitted a Comment to Solution 1931727 Nice and Easy on 12 Sep 2019 at 5:30 Hieu Tran submitted a Comment to Solution 1930828 whyyyyy on 11 Sep 2019 at 15:21 still problem with test suit x2=3; x3=9; [fr1,fc1]=find(and(x1>=x2,x1<x3)) fails on 10 Sep 2019 at 13:50 Nhat Lam Nguyen submitted a Comment to Solution 1928846 From Viet Nam with love on 10 Sep 2019 at 10:39 great problem on 10 Sep 2019 at 10:37 Nhat Lam Nguyen submitted a Comment to Solution 1928827 good on 10 Sep 2019 at 10:34 Nhat Lam Nguyen submitted a Comment to Solution 1928761 easy on 10 Sep 2019 at 10:11 Nhat Lam Nguyen submitted a Comment to Solution 1928749 nice on 10 Sep 2019 at 10:06 test suit is broken plz fix since its a budge problem on 9 Sep 2019 at 17:49 David Hill submitted a Comment to Problem 44961. RSA decryption Sorry, I did not mean to do that. Fixed. on 8 Sep 2019 at 23:27 William submitted a Comment to Problem 44961. RSA decryption David -- Good problem. I got sidetracked by the fact that the arguments 'd' and 'n' in the solution template are reversed from the order that they are provided in the test problems. on 8 Sep 2019 at 20:22 Ahmed Nazir submitted a Comment to Problem 22. Remove the vowels #WARNING Character Array And String are not similar. length('abc') % 3 length("abc") % 1 so 'abc' is NOT EQUAL to "abc" use "char" function to get character array from string char("abc") % 'abc' on 7 Sep 2019 at 7:06 Tim Wilkin submitted a Comment to Solution 858845 This is not a valid solution. It does not meet the requirement of elements in each subset being sorted. Try the input [1 3 2] and it does not give sorted subsets. on 5 Sep 2019 at 23:23 I don't know on 4 Sep 2019 at 6:35 Convert byte array into an integer/biginteger on 3 Sep 2019 at 14:36 In the first test suite, Robinson and Reed both have the same age, so I think either the test suite should be improved or Reed's age in the .mat file should be changed. on 3 Sep 2019 at 9:20 1 on 3 Sep 2019 at 1:49 Sorry, but I don't understand your instruction to "convert the uint8 array to a long integer string". Could you be more specific? on 3 Sep 2019 at 0:47 Md Saif Ansari submitted a Comment to Problem 167. Pizza! Very Nice Question! on 2 Sep 2019 at 22:20 Doan Quang Manh submitted a Comment to Solution 1172620 nice :) on 2 Sep 2019 at 14:29 Timothy Chavez submitted a Comment to Solution 1917732 This solution seems to run correctly in MATLAB (desktop)... can anyone tell me why it is coming back with an "Assertion Failed"? function vec = makeRandomOrdering(n) vec = zeros(1, numel(n)); flags = zeros(1, numel(n)); index = 1; while (sum(flags) ~= numel(n)) pos = randi(numel(n)); if (flags(pos) ~= 1) vec(index) = n(pos); index = index + 1; flags(pos) = 1; end end end on 31 Aug 2019 at 22:50 Something weird is happening When I submit the size of my code is -1 and it fails the test suite when it seems to work fine in MATLAB desktop. on 30 Aug 2019 at 20:19 Malcolm Wildgoose submitted a Comment to Solution 1915445 Nice! on 29 Aug 2019 at 15:54 Tim submitted a Comment to Solution 1915449 Googling can supplant programming sometimes. on 29 Aug 2019 at 13:37 is good on 29 Aug 2019 at 13:26 Tim, you are absolutely correct. Thanks for the comment. I fixed the test cases. on 28 Aug 2019 at 22:46 If I understand correctly, we should have mod(d*e,phi)=1, where phi=(p-1)*(q-1). My answers seem to satisfy that condition, but test cases 2, 3, and 4 do not. on 28 Aug 2019 at 21:23 This was my first Cody problem and I had a mistake in the assert within the test cases. I fixed the problem. Previously the assert was looking for [n,d] combined into a single character array. I have tested the test cases and they are correct. You should use the Euclidean algorithm. on 28 Aug 2019 at 20:58 I get different results for d in test cases 2, 3, and 4 (in particular, d=929660805638728623653 for test case 2). on 28 Aug 2019 at 20:37 danteliujie submitted a Comment to Solution 553551 Nice! on 28 Aug 2019 at 8:47 math math submitted a Comment to Solution 1913368 one of the simplest task. on 27 Aug 2019 at 12:13 Ethan Zhang submitted a Comment to Solution 1857591 WTF on 26 Aug 2019 at 3:32 Ivo Georgiev submitted a Comment to Solution 1909426 tf=~any(sum(x-length(x)^2-1)+norm(x,inf)) the best on 23 Aug 2019 at 20:06 Eugene Avrutin submitted a Comment to Solution 1910169 why no accept on 23 Aug 2019 at 14:10 Eugene Avrutin submitted a Comment to Solution 1910037 this seems a bit silly on 23 Aug 2019 at 11:22 Jennifer Winikus submitted a Comment to Solution 402276 Looking at the test cases first will save lots of complications on 21 Aug 2019 at 19:19 Did I just solved this myself? Toughest for me so far. Thanks!!! on 21 Aug 2019 at 15:15 obfish submitted a Comment to Solution 489354 wonderful on 21 Aug 2019 at 2:13
1 – 50 of 9,887