Search
Japt -d, 8 bytes °*U*3¥NÉ Try it 9 bytes NøT±1wU*6 Try it
Bash, 205 bytes for s in C{C{CC,D,M},DC,MC} {CM,DC,D}{D,M} I{C,D,I{II,V,X},L,M,VI,X{C,I,L,V,X}} L{C,D,L,M,XC,XL} MMMM V{C,D,IV,IX,L,M,V,X} X{C{C,D,L,M,X},D,LX,M,X{C,L,XX}} do echo $1|grep -q $s...
A limit of 1 character for Challenges and Sandbox Now that Monica has pointed out that adjusting the minimum is already possible per category, I propose that we leave the minimum at 15 characters ...
Dyalog APL, 10 bytes ⊢∊1+\⍤,6×⍳ Port of lyxal's Vyxal answer. Explanation ⊢∊1+\⍤,6×⍳...
Something I would like to see here are explicit and specific constraints on how submitted solutions are expected to accept the challenge input and output their solutions (if output is the goal). F...
AWK, 28 26 21 bytes $0=$1~2&&$2~2?5:$1+$2 Try it online!
Rust, 258 254 bytes Saved four bytes thanks to trichoplax. fn v(s:&str)->&str{for b in "CCCC CCD CCM CDC CMC CMD CMM DCD DCM DD DM IC ID IIII IIV IIX IL IM IVI I...
AWK, 80 bytes {split("I V X L C D M 1 5 10 50 100 500 1000",d);for(;d[++i]!=$1;);print d[i+7]} Try it online! A quick map function. 'split' breaks the string into array elements. Find the stri...
C (gcc), 30 bytes main(){puts("Hello, World!");} Try it online! This is using GNU C extensions. GNU C allows main() over int main(), ss well as using puts without including stdio.h.
K (oK), 9 bytes {x#0}'!10 Try it online! !10 / pass range your arbitrary number .' / treat those as a list, and evaluate each separately { } / main function...
AWK, 82 bytes {split($1,d,"");i=a=d[1];for(x in d){d[x]>a?a=d[x]:0;d[x]<i?i=d[x]:0}print a+i+$1} Try it online! Just pass your input, e.g.: echo "123" | awk '...'
JavaScript, 36 bytes n=>n==(g=d=>--d?(n%d?1:d)*g(d):1)(n) Try it online!
UiuaSBCS # Experimental!, 8 bytes ++↧∩=₂,, Try it here! Explanation ++↧∩=₂,, ,, Make a copy of the two arguments ∩=₂ Are they both equal to 2? ↧ Minimum ++ Add the...
Japt, 15 bytes Port of m90's JS solution, until I manage to come up with something shorter. ;Bg7^Mm8|#ÿ^3îU Try it
Some time has passed, and the leaderboard there now looks like this: It appears that the entry showing as undefined is confusing the leaderboard. I don't know what governs the placement of that...
Japt v1.4.5, 7 bytes â¬d!øUs Try it â¬d!øUs :Implicit input of integer U ⬠:Divisors, excluding itself d :Are any !ø : Contained in Us : The s...
JavaScript, 42 bytes s=>(g=n=>--n&&s.includes(s%n?g:n)|g(n))(s) Try it online!
Japt, 17 bytes 0-indexed gU²o!gM fÈì äa eÉ Try it 15 bytes 1-indexed @µXì äa eÉ}f!gM Try it
C (gcc), 53 bytes This uses the shortcut behaviour of logical or (||) to only multiply if it is a divisor; the loop end condition then makes sure it's a proper divisor. i=1;p=1;f(n){for(;i<n...
C (gcc), 37 bytes This takes an integer as input. It uses the fact that the last digit is odd if and only if the number is odd, and that integer division by 10 removes the last digit. Testing if ...
C (gcc), 41 bytes r;o(char*s){for(;*s;r+=*s++&1);return r;} Try it online! This is under the assumption that in a function solution, input has to be passed as parameter and output throug...
Vyxal, 4 bytes KΠ√= Try it Online! Another 4 byter, but uses the definition of A007422 that a number returns true if product(divisors) == input ** 2. Explained KΠ√=...
Japt v1.4.5, 4 bytes ¶â¬× Try it ¶â¬× :Implicit input of integer ¶ :Is equal to ⬠:Proper divisors × :Reduced by multiplication
