Search Results

Python 3, 232 bytes Not really that short, but it uses a different method to the Python solution already posted l=list(map(int,[y for x in input().split(',')for y in x.split(' ')])) f=[];x=1 while …

Fourier, 147 74 bytes Non-competing because string printing is newer than this challenge I~AoI~B` is `<A{1}{`greater than`}A<B{1}{`less than`}A{B}{`equal to`}` `Bo Try it on FourIDE! Dunno why I …

Fourier, 17 bytes I~x^ox%2{0}{@xvo} Try it on FourIDE! Explanation: I~x - Stores input in a variable called x x^o - Increments x and outputs x%2{0}{ } - …

Noether, 39 bytes I~A{A0>}{A(i1+~i(j1+~jP" "P£)" "P0~ji)} Try it here! Explanation: I~A - Push User Input onto the stack and store in variable A {A0>} - If A>0 { - Then do A( - loop until to …

Noether, 91 79 bytes I~aP" is "PI~b{ab=}{"equal to"P}{ab>}{"greater than"P}{ab<}{"less than"P}" "PbP Try it here! Note that while Noether is based heavily on Fourier, I have sacrificed golfability fo …

Challenge Given two integers A and B as input, you must write a program which outputs if A>B, A==B or A<B. The integers will be in any reasonable range supported by your language which includes at lea …

Fourier (Non-Competing), 79 bytes 1~RI~X<0{1}{0-1~R45a}X*R~XL*2+2/2~UX{1}{0~U}10P10/X~DL+U~p10Pp~TD/To*T~A46aD-Ao Try it online! This is non-competing for two reasons: Firstly, it does not fulfi …

Fourier, 16 bytes I~NL~S10PS~XN/Xo Try it online! As other answers have done, outputs the first digit of the input. An explanation of the code: N = User Input S = log(N) X = 10 ^ S Print (N/X)

Fourier, 30 bytes I~S<0{1}{-2*S~S}S{0}{S^~S}SL^o Try it on FourIDE! Fourier doesn't have strings, so it uses logs instead. Bytes are wasted on supporting zero and negative numbers.

Fourier, 26 bytes I~X1(&N^*N/2{X}{1~O}N=X)Oo Try it online!

Fourier, 37 bytes oI~AI~B>A{1}{A~SA~BS~B}A/2+7>B{1}{@o} Try it on FourIDE! Takes two numbers as input. Will golf later.

Python 3, 46 bytes lambda x:[0]+[x[i]%i for i in range(1,len(x))] Simples ;)

Noether, 4 bytes II=P Try it online!

Noether, 55 bytes I~sL(si/~c{"<"=}{k10+~k}c{"T"=}{!k}c{" "=}{k60*~k}!i)kP Try it online! Same approach as @Arnauld.

Challenge Given an ASCII representation of a Babylonian number as input, output the number in Western Arabic numerals. Babylonian Numeral System How did the Babylonians count? … You then add up the value of each to get the value of the number. Columns will be separated by spaces to prevent ambiguity. …