In light of today's date... A factorial of a number n, is the product of all the numbers from 1 to n inclusive. The Challenge Given an integer n where 42 <= n <= 420, find the sum of the digits of n!. It's that simple :P Notes: I feel like this challenge isn't too simple, as some languages ha...

Operate on a subset of a register code-golf matrix quantum-computing Note: You do NOT need to know anything about quantum mechanics or quantum computing to understand this challenge. I've tried to include sufficient background for any old code golfer to realize what's going on. Motivation (muc...

tcs has employees numbered from 1 to n . It wants to divide them into two non-empty teams. The team sizes may be unequal, but each employee must belong to exactly one team. For some small groups of employees, it's known that they would work more efficiently if all members of the group are on the...

Triangular Lattice Points close to the Origin code-golf geometry Background A triangular grid is a grid formed by tiling the plane regularly with equilateral triangles. The picture below is an example of a triangular grid. A triangular lattice point is a vertex of a triangle forming the tria...

Usually I can see import lib f=func where the f= is using and left part is code. Do I always need to recount the bytes by myself and just leave a tio that don't point exactly to which place us counted bytes?

I have read Sort numbers by binary 1's count (not a duplicate) Goal Sort the integers in ascending order by the number of 1's in their binary representations. For example, 7(dec) → 111(bin) and 8(dec) → 1000(bin), so 8 (which has single 1 in binary) would be ordered before 7 (which has triple ...

Smallest code to import Given some head files that need to import, return the shortest code to do so. You are allowed to access include/ What more assumption necessary? (#if don't effect imported heads?) Time limit necessary? code-golf parsing

No title Given a function with boolean inputs a1, ..., an and a boolean output, output an array of numbers 0 to n satisfying: For each item in the truth value, if (we repeatedly remove two adjacent numbers x and y satisfying that, for each integer n between x+0.5 and y+0.5, an=1), we can get an...

This challenge is completely ripped offheavily inspired by All Light, developed by Soulgit Games. Challenge You are an electrician, and it's your job to wire up all the lights to the battery. The lights and battery are laid out in a grid. You can connect a light or battery to the nearest ligh...

Prime Factor Encoding You goal is to encode a string of bits as a single integer using primes. How? Hold a prime (starting with 2) Have a list For each bit in the input If it's the same as the previous bit, add the prime you're holding to the list If it's different, hold the next prime and ...

I'm serious. Does anybody here remember viewing any pages on PPCG.SE before the fifth of this month? Because according to the site analytics (5k+ only), the only time anybody has ever visited or viewed pages on this site was between April 5th and April 10th, 2018. This is rather strange, beca...