Skip to main content
We’ve updated our Terms of Service. A new AI Addendum clarifies how Stack Overflow utilizes AI interactions.
Code Golf

Return to Answer

Commonmark migration
Source Link

#Pyth, 64 bytes

Pyth, 64 bytes

#Pyth, 64 bytes

Pyth, 64 bytes

replaced http://stackoverflow.com/ with https://stackoverflow.com/
Source Link

Uses http://stackoverflow.com/a/2163753/4230423 https://stackoverflow.com/a/2163753/4230423 except that a)No cache since Pyth automatically memoizes, b)Prints each instead of appending to list, and c) is translated to Pyth.

Uses http://stackoverflow.com/a/2163753/4230423 except that a)No cache since Pyth automatically memoizes, b)Prints each instead of appending to list, and c) is translated to Pyth.

Uses https://stackoverflow.com/a/2163753/4230423 except that a)No cache since Pyth automatically memoizes, b)Prints each instead of appending to list, and c) is translated to Pyth.

deleted 44 characters in body
Source Link
Maltysen
  • 25.8k
  • 4
  • 56
  • 127

#Pyth, 6864 bytes

try it here online .

M?smg-Gddr1h?H<HGGG1AkdGddr1hhS,QOgQQWQFNr1h?k<kQQKgGHG1Akd,QOgQQWQFNr1hhS,QkKg-QNNI<dKB=dQNNI<dKB-dK=dK)N=kN=QN=kN-QN=QN
M Lambda g(G,H)
 ? G If G truthy
 s Sum
 m Map
 g Recursive call
 -Gdd G-d,d
 r Range
 1 1 to
 h +1
 ?hS <HG If H<G (thisFirst element of sorted (does min)
 H  ,GH H
 From G Elseand GH
 1 Else 1
A Double assign
 kd Vars k and d
 , To vals
 Q Q (evaled input)
 O Randrange 0 till val
 gQQ Call g(Q, Q)
WQ While Q is truthy
 FN For N in
 r Range
 1 From one
 h Till +1
 ?k<kQQhS,QK  Min(Q,K)
 Kg K=g(
 -QN Q-N
 N N
 I<dK If d<k
 B Break (implicit close paren)
 =d-dk=dk  Subtracts d-=k
 ) Close out for loop
 N Prints N
 =kN Set k=N
 =Q-QN=QN  Subtracts Q-=N

#Pyth, 68 bytes

try it here online .

M?smg-Gddr1h?H<HGGG1Akd,QOgQQWQFNr1h?k<kQQKg-QNNI<dKB=d-dK)N=kN=Q-QN
M Lambda g(G,H)
 ? G If G truthy
 s Sum
 m Map
 g Recursive call
 -Gdd G-d,d
 r Range
 1 1 to
 h +1
 ? <HG If H<G (this does min)
 H  H
 G Else G
 1 Else 1
A Double assign
 kd Vars k and d
 , To vals
 Q Q (evaled input)
 O Randrange 0 till val
 gQQ Call g(Q, Q)
WQ While Q is truthy
 FN For N in
 r Range
 1 From one
 h Till +1
 ?k<kQQ Min(Q,K)
 Kg K=g(
 -QN Q-N
 N N
 I<dK If d<k
 B Break (implicit close paren)
 =d-dk Subtracts d-=k
 ) Close out for loop
 N Prints N
 =kN Set k=N
 =Q-QN Subtracts Q-=N

#Pyth, 64 bytes

M?smg-Gddr1hhS,GHG1Akd,QOgQQWQFNr1hhS,QkKg-QNNI<dKB-=dK)N=kN-=QN
M Lambda g(G,H)
 ? G If G truthy
 s Sum
 m Map
 g Recursive call
 -Gdd G-d,d
 r Range
 1 1 to
 h +1
 hS First element of sorted (does min)
 ,GH From G and H
 1 Else 1
A Double assign
 kd Vars k and d
 , To vals
 Q Q (evaled input)
 O Randrange 0 till val
 gQQ Call g(Q, Q)
WQ While Q is truthy
 FN For N in
 r Range
 1 From one
 h Till +1
 hS,QK  Min(Q,K)
 Kg K=g(
 -QN Q-N
 N N
 I<dK If d<k
 B Break (implicit close paren)
 -=dk  Subtracts d-=k
 ) Close out for loop
 N Prints N
 =kN Set k=N
 -=QN  Subtracts Q-=N
added 1028 characters in body
Source Link
Maltysen
  • 25.8k
  • 4
  • 56
  • 127
Loading
Source Link
Maltysen
  • 25.8k
  • 4
  • 56
  • 127
Loading

AltStyle によって変換されたページ (->オリジナル) /