Transpose the input code-golf
Given a textual input, output its transposition.
Test cases
Test 1
Hello, world!
Hello, world!
Test 2
ABCDEFGHIJKLMNOPQRSTUVWXY
AFKPUBGLQVCHMRWDINSXEJOTY
Test 3
Some lines maybe longerthan others.
Sbtoehm aeln o lnoigtneheres r sm .ay
Which HEX color should I use?
Introduction
Oh dear! I can't choose which color to use!
So... I've been working on a console with only 16 colors. And sometimes, the color I want does not perfectly match the 16 colors. Can you help me out a bit?
Challenge
Given an input(could be from STDIN o...
Well I don't think there's that much harm in knowing which high school... Pretty much everyone here is international and that's the only personal information anyone knows about me AFAIK
I found this in my Inbox today. I think someone is playing a prank, but ... well ... I'm really not sure!
Puzzling friends, can you please take a look and see if you can tell what's up with this message?
Date : 08-JUN-2017
Dossier : RAND AL'THOR
Subject : ELECTRONIC SURVEILLANCE REPO...
I have loaded Code::Blocks yesterday, and running codes. When you write code to count words or space or some other characters, it just opens a command prompt, and I keep adding characters and it doesn't shows anything.
@LeakyNun Well there's no compiler yet, a full-featured language isn't exactly easy to write a compiler for, plus the syntax used to change quite a lot so there was no point having an example file
What type are my suffixes?
So I've been wasting my time again researching suffix sorting algorithms, evaluating new ideas by hand and in code. But I always struggle to remember the type of my suffixes! Can you tell me which type my suffixes are?
Left-most what?
A lot of suffix sorting algorith...
Hmm, so in the case of the anagram quine challenge, would \n1 (which outputs 1\n in Braingolf) be valid? I don't think it meets our definition of a proper quine (minus the quine part), but I'm not entirely sure
@LeakyNun Of course it does, Brachylog transpiles the Input/Output using the same code as what transpiles the program, so if it works in the former it works in the latter!
What is the smallest, in terms of space, possible compilable and runnable Java code? The first code I can think of is below:
public class C {
public static void main(String[] a){
}
}
When I saw this title in the Hot Network Questions I thought it was going to be a PPCG challenge. I was a little disappointed when it was on Mathematica.
So now it is on PPCG:
Challenge
Given an input string, output the ROT13, flipped value. The input will contain characters from the following...
But I'm going to be using this regex for a parser engine
So I'm using a parser engine (Jison), which uses regex (JS regex), to parse regex (my regex), which I'm going to use to make a parser engine (my parser engine)?
It's Hip to be Square!
code-golfmath
Meta
Is this a good challenge?
Is it a dupe?
Would it add anything to the challenge if, instead of reducing the array by addition, I alternated between adding & subtracting each integer?
Any suggestions for test cases?
Tag suggestions?
...
So, both FryAmTheEggman and @Mayube have mentioned that we don't have a code golf challenge asking if a given number is a perfect square. Is that true? Can someone provide a link if not? If so ... dibs!
Thanks to your doc @LuisMendo I thought since ~0 is a logical ~0: converts 1 to a numerical vector. I guess that’s why 0X#~X#:X# is different from 1X#:X# (input shifts to the left in the stack when logical)?
The current meta consensus is that the implementation defines the language. The cannonical answer is: What's the policy on interpreter bugs?
I think this is too rigid: I think that a specification should also be able to define a language, if and only if the specification is sufficiently rigorous...
Challenge
So, um, it seems that, while we have plenty of challenges that work with square numbers or numbers of other shapes, we don't have one that simply asks:
Given an integer n (where n>=0) as input return a truthy value if n is a perfect square or a falsey value if not.
Rules
You may ...
Challenge
So, um, it seems that, while we have plenty of challenges that work with square numbers or numbers of other shapes, we don't have one that simply asks:
Given an integer n (where n>=0) as input return a truthy value if n is a perfect square or a falsey value if not.
Rules
You may ...