« first day (3351 days earlier)      last day (64 days later) » 

1:24 AM
@Adám It has grown to 11 people in just a day. However, it should have been growing a lot faster.
(And... it has 3 new repositories.)
 
 
4 hours later…
5:12 AM
0
Q: Multiplayer Rock-Paper-Scissors

Dannyu NDosObjective Given a nonempty multiset of Rock, Paper, and Scissors, output the winning figure according to the special rule. Background For a multiplayer RPS, if all three figures come out, usually it's considered a draw. But by that rule, the probability to draw would dramatically increase when...

 
 
2 hours later…
7:25 AM
1
Q: Boil eggs using hourglasses

anatolygThese are the classical puzzles: You need to boil eggs for exactly 9 minutes, or else the visiting Duchess will complain, and you will lose your job as head chef. But you have only 2 Hourglasses, one measures 7 minutes, and the other measures 4 minutes. How can you correctly measure 9 mi...

0
Q: Does base n have any Rotate-Left-Double numbers?

BubblerTask A Rotate-Left-Double number in base \$n\$ is a number \$m\$, when its base-\$n\$ digits are rotated left once, equals \$2m\$. The base-\$n\$ representation of \$m\$ cannot have leading zeros. One example in base 7 is the number 480, or \$1254_7\$. When rotated left once, the value becomes ...

 
 
1 hour later…
8:51 AM
0
A: Sandbox for Proposed Challenges

BubblerRotate-Left-Double seed numbers in base n code-golf base-conversion Second try at writing a challenge on RLD numbers. Task A Rotate-Left-Double (RLD) number in base \$n\$ is a positive integer \$m\$, when its base-\$n\$ digits are rotated left once, equals \$2m\$. The base-\$n\$ representation...

 
 
1 hour later…
10:02 AM
0
Q: How to deal with an accidental chameleon challenge

BubblerNote: How should we deal with chameleon questions is about a challenge that has a description significantly changed so that existing answers are invalidated in the way. This question is about a different definition of "chameleon challenge". Definition: Chameleon challenge A chameleon challeng...

 
10:45 AM
0
A: Sandbox for Proposed Challenges

PkmnQCorrect the Roman Numerals code-golf string roman-numerals Take a roman numeral as input, and output the correct form. Examples I -> I II -> II IIII -> IV IIIII -> V VIIII -> IX VV -> X IIIIIIIIII -> X

 
 
3 hours later…
1:53 PM
hi all
CMC Code to tell if two strings have edit distance exactly 2 that runs in linear time.
 
 
6 hours later…
7:45 PM
0
Q: Code golf edit distance 2

AnushThe edit distance between two strings is the minimum number of single character insertions, deletions and substitutions needed to transform one string into the other. This task is simply to write code that determines if two strings have edit distance exactly 2 from each other. The twist is that...

 
 
2 hours later…
10:08 PM
0
A: Sandbox for Proposed Challenges

Dannyu NDosDecode Arabic to Arabic Presentation Form Objective Given an Arabic string consisting of ISO/IEC 8859-6 Arabic letters (U+0621–063A, 0640–064A), decode it to Arabic Presentation Form-B (U+FE70–FEFF). Behavior of Arabic letters ISO/IEC 8859-6 Arabic letters change their displayed form to lette...

 
 
1 hour later…
11:38 PM
0
Q: Do golfing languages support parallelism or concurrency?

Dannyu NDosSay, I propose a challenge like Scream Very Loudly, but the program must print 'A' once a second and must halt immediately when Enter key is pressed. If I understand parallelism and concurrency correctly, that would require two threads in parallel, one printing 'A' and one waiting for an input. ...

0
Q: CGCC Data Analysis #1: Tags

Redwolf ProgramsA few months ago I posted a few interesting bits of research on data from SEDE. It was fairly well-received, so I figured I'd do some more analysis. I might make this a weekly thing. I decided to start with tags. This post will show some data relating to the most used tags, the popularity of pos...

 
CMC: Dehydrate a string: remove all the letters H to O (in upper case only) inclusive. You can assume the string contains printable ASCII.
 

« first day (3351 days earlier)      last day (64 days later) »