Cody

goc3

6
Rank
64
Badges
29765
Score
1 – 50 of 3,206

goc3 submitted a Comment to Problem 44819. Relative pose in 2D: problem 1

Sorry for any confusion that may have been caused. Yes, there may be a need for more detailed explanations of some site functioning, but that is beyond my power. For what it's worth, the scoping rule is consistently applied for all problems on the site: variables called within each test case are only available to that test case. I (and many other problem creators) end up repeating lines for any required variables within each test case.

on 25 Jan 2019 at 13:00

goc3 received Curator badge for Sequences & Series III

on 22 Jan 2019 at 20:54

goc3 received Curator badge for Computational Geometry II

on 22 Jan 2019 at 14:50

goc3 received Curator badge for Indexing IV

on 21 Jan 2019 at 18:05

goc3 received Curator badge for Strings II

on 21 Jan 2019 at 17:03

goc3 received Curator badge for Matrix Manipulation II

on 21 Jan 2019 at 7:38

goc3 received Curator badge for Sequences & Series II

on 20 Jan 2019 at 7:22

goc3 received Curator badge for Matrix Patterns II

on 18 Jan 2019

goc3 received Curator badge for Indexing V

on 18 Jan 2019

goc3 received Curator badge for Project Euler I

on 18 Jan 2019

goc3 received Curator badge for Magic Numbers II

on 18 Jan 2019

goc3 received Curator badge for Matrix Manipulation I

on 17 Jan 2019

goc3 received Curator badge for Indexing III

on 17 Jan 2019

goc3 received Curator badge for Indexing I

on 17 Jan 2019

goc3 submitted a Comment to Problem 44243. Ternary Conditional Operator

The test suite has been fixed. (The initial line is no longer commented out.)

on 17 Jan 2019

goc3 submitted a Comment to Problem 44819. Relative pose in 2D: problem 1

A %% needs to be added before the first line. Otherwise, the server parses that first line of the test suite as a comment. I've fixed it here; feel free to fix this problem wherever else it occurs in problems you've created.

on 17 Jan 2019

goc3 received Curator badge for Draw Letters

on 17 Jan 2019

goc3 received Curator badge for Card Games

on 17 Jan 2019

goc3 received Curator badge for Solution 1707781

on 16 Jan 2019

goc3 submitted a Comment to Solution 1705821

You need to find a way to operate on the string, which may involve mathematical operations on small portions of the string, bit by bit, converting small portions of the string to a number, in an iterative fashion, etc., based on the method you choose. str2num() is subject to loss of precision for very large numbers and will not work for at least one test case in essentially all of these problems (by design).

on 11 Jan 2019

goc3 submitted a Comment to Solution 1705227

That test case has the longest string input, by far. Your solution is coded to only sum digits twice. After those two steps, the resulting sum in this specific case is still greater than 9, and, therefore, fails your test of equal to a single-digit multiple of three (3, 6, or 9).

on 10 Jan 2019

goc3 submitted a Comment to Solution 1704295

The error you are receiving has to do with the Cody server, not your function. Try it again (wait a few hours between attempts) until you no longer see the "temporary unavailability of MATLAB Service" error.

on 8 Jan 2019

goc3 submitted Problem 44815. Word Distance - Sum

on 2 Jan 2019

goc3 submitted a Comment to Solution 1697979

The fibonacci() function is part of the Symbolic Math toolbox. Cody utilizes vanilla Matlab and does not currently support toolbox functions.

on 2 Jan 2019

goc3 submitted Problem 44812. Draw Dominos

on 4 Dec 2018

goc3 submitted a Comment to Problem 44794. Testing Problem Creation

@Vipresh Gangwal: there is no need to publish test problems. You can click the Unpublish button on the problem's edit page to remove it from public view until it is complete. Also, you can, and should, supply a reference solution and use the "Test reference solution" button on the edit page to ensure that the problem is solvable and properly functioning before it is published.

on 28 Nov 2018

goc3 submitted a Comment to Problem 44756. Lights Out 5 - 5x5, 10 moves

@li haitao: I got 3.838179s (total time for test suite) for William's solution and 0.986936s (1/4 the time) for your sped-up version. Impressive.

on 15 Nov 2018

goc3 liked Problem 44754. How many days?!?

on 15 Nov 2018

goc3 submitted a Comment to Problem 44756. Lights Out 5 - 5x5, 10 moves

@li haitao: the test suite has been updated. Also, problem #7 in the series (not out yet, but will be soon) is similar to what you suggest. Thanks for the comments.

on 13 Nov 2018

goc3 submitted a Comment to Problem 44756. Lights Out 5 - 5x5, 10 moves

@William: thanks for catching that. Actually, test case 4 was intentional, as it can also be solved in 10 moves. But, to prevent future confusion, I have replaced it. And, test case 11 was indeed an error—it has been fixed.

on 13 Nov 2018

goc3 submitted a Comment to Problem 3103. Find out Harmonic mean.

I believe that harmmean() is a toolbox function. For now, Cody doesn't support toolboxes.

on 9 Nov 2018

goc3 submitted a Comment to Problem 11. Back and Forth Rows

The problem with the first test case has been fixed here.

on 9 Nov 2018

goc3 submitted a Comment to Problem 1694. Now 20% off!

The problem with the first test case has been fixed.

on 9 Nov 2018

goc3 submitted a Comment to Problem 44753. Lights Out 3 - 5x5, 6 moves

@li haitao: While your solution does solve many test cases in under 0.8 seconds, the times above were referring to the total time for the whole test suite. When your times are added up for all the test cases, the total time is over 4 seconds. While less than the total time for other solutions, it is still increasing over other problems with fewer moves. Also, as I already mentioned, future problems will tend to have even more test cases, making it harder to solve some within the time limit. And, the final problems will most definitely not be solvable by brute-force methods.

on 8 Nov 2018

goc3 submitted a Comment to Problem 44753. Lights Out 3 - 5x5, 6 moves

@li haitao: I understand that you might not want to see so many problems in the series, but they are purposefully building up to larger, more difficult problems in a pedantic fashion so as to be accessible to a broad range of users. It is rather curious that you make such comments about being able to solve these problems using brute-force methods without having solved any of them, as far as I can see. I have timed each of the submitted problems for the three problems so far using Cody servers, and they yield the following approximate times: #1 (3 moves): 1/4 to 1/2 second #2 (4 moves): 1/2 to 2 seconds #3 (6 moves): 25 to 30 seconds (this includes a modified solution from a prior problem) As far as I am aware, the Cody servers time out at 30 seconds, so further problems will not be solvable by brute-force methods. I tested that on a planned problem with more moves using two modified solutions from prior problems, and they do appear to time out. While it is technically possible to solve many of these (current and planned) problems by brute-force methods, it is not practically feasible (or possible on Cody due to server time limits). The number of test cases in future problems generally increases or stays at a high number to help prevent brute-force methods from working. I added various references to the first problem in the series as potential starting points for developing actual solvers. I would encourage you to check them out and try these first problems without using brute-force methods that will only go so far.

on 7 Nov 2018

goc3 submitted a Comment to Problem 44775. Solve The Equation

The problem description and test suite have been cleaned up.

on 5 Nov 2018

goc3 submitted Solution 1663202 to Problem 44763. Pumpkin Pie!

on 31 Oct 2018

1 – 50 of 3,206