Sandbox
Definition: A positive integer n is almost-prime, if it can be written in the form n=p^k where p is a prime and k is also a positive integers. In other words, the prime factorization of n contains only the same number.
Input: A positive integer 2<=n<=2^31-1
Output: a truthy value, if n is...
@Razetime Hey, I was wondering whether someone else would answer the factorial challenge in Pip if I waited! :D
Here's a tip: the version with a takes input from a command-line argument (TIO). That is the most common input method in Pip; q is less convenient because you have to assign the value to another variable if you want to use it more than once. Not a problem for this challenge, though.
Keep the symmetry
SANDBOX: I am aware that the language in this challenge, as it stands, is quite... fluffy. If anyone could help me firm it up, I would be grateful. Also, would this be better as a cops-and-robbers style challenge, where the cops are trying to make the output more symmetrical, an...
