Timeline for Count without 3
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 2, 2018 at 6:26 | comment | added | lee | @MorganThrapp please check out my c# answer with recursion at 49 bytes :) | |
| Nov 3, 2016 at 17:24 | comment | added | Morgan Thrapp | @Grax Basically, you need to include any code required for the code to run except the assignment to a name in the case of a non-recursive function. I don't know where you would find a concrete set of guidelines, unfortunately. | |
| Nov 3, 2016 at 17:21 | comment | added | Grax32 | Is there somewhere I can go to see these guidelines? I find C# golfing confusing on here. | |
| Nov 3, 2016 at 17:19 | comment | added | Morgan Thrapp | The problem is that if I make it recursive, I then have to count the function and type definitions. | |
| Nov 3, 2016 at 17:17 | comment | added | Grax32 |
You can get it down to 43 if you make it recursive t=x=>(++x)%3<1|(x+"").Contains("3")?t(x):x; In Visual Studio, you just need to define the variable and set it to null Func<int, int> t = null; and then define the recursive function on the following line.
|
|
| Nov 3, 2016 at 17:00 | history | edited | Morgan Thrapp | CC BY-SA 3.0 |
added 6 characters in body
|
| Nov 3, 2016 at 16:49 | history | answered | Morgan Thrapp | CC BY-SA 3.0 |