Subtract my odds from my evens

Question

Given a non-negative integer, return the absolute difference between the sum of its even digits and the sum of its odd digits.

Default Rules

Standard Loopholes apply.
You can take input and provide output by any standard Input / Output method.
You may take input as a String, as an Integer or as a list of digits.
This is code-golf, so the shortest code in bytes in every language wins!

Test Cases

Input ~> Output

0 ~> 0 (|0-0| = 0)
1 ~> 1 (|1-0| = 1)
12 ~> 1 (|2-1| = 1)
333 ~> 9 (|0-(3+3+3)| = 9)
459 ~> 10 (|4-(5+9)| = 10)
2469 ~> 3 (|(2+4+6)-9| = 3)
1234 ~> 2 (|(2+4)-(1+3)| = 2)

@Mr.Xcoder That wouldn't be too trivial. It makes the challenge unnecessarily complicated and is an arbitrary requirement that adds bytes. — Okx, Jul 10, 2017 at 16:46
@Mr.Xcoder Don't make chameleon challenges. The most important sentence you might want to look at here is Combining two or more unrelated core challenges into one — consider splitting the challenge up into separate challenges or dropping unnecessary parts — Okx, Jul 10, 2017 at 16:51
I have changed the rules @Okx. Taking as a list of digits is now allowed. I still don't think it would make it to fluffy though. — Mr. Xcoder, Jul 10, 2017 at 16:55
333 ~> 9 (|(3+3+3)-0| = 9) should be 0-(3+3+3), though the outcome is the same. — Magic Octopus Urn, Jul 11, 2017 at 20:37

lirtosiast · Accepted Answer · 2017-07-13 22:04:06Z

1

TI-BASIC, 11 6 bytes

abs(sum(Anscos(πAns

Takes input as a list. i²^Ans saves two bytes over (-1)^Ans because we don't need the parentheses.

abs(sum(Anscos(πAns
           cos(πAns                  1 for evens, -1 for odds
        Ans                          Multiply by original list
abs(sum(                             Sum the list and take absolute value, which also
                                     fixes rounding errors from cos(.

edited Jul 13, 2017 at 22:04

answered Jul 11, 2017 at 0:58

lirtosiast

21.3k5 gold badges50 silver badges126 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

J, 14 bytes

|-/(2&|+//.[),

Try it online!

explanation

|                absolute value of
 -/              the difference between
                 the items on the list returned by this fork
   (2&|          is an item odd? (1 for yes, 0 for no)
       +//.      the "key" verb /. which partitions on above (even / odd) then sums
           [)    identity, ie, the list of digits passed
             ,   turn it into a list (to handle 1 element case)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 10, 2017 at 17:30

Jonah

31.5k4 gold badges35 silver badges88 bronze badges

Add a comment |

sergiol · Accepted Answer · 2017-08-01 23:54:07Z

1

Tcl, 55 bytes

lmap e $V {incr s [expr $e*-1**$e]}
puts [expr abs($s)]

Try it online!

edited Aug 1, 2017 at 23:54

answered Aug 1, 2017 at 23:47

sergiol

3,3881 gold badge13 silver badges31 bronze badges

Add a comment |

Unihedron · Accepted Answer · 2017-12-16 15:07:14Z

1

Ruby, 45 bytes

Function; Full number

->n{s=0
n.digits.map{|x|s+=x%2>0?x:-x}
s.abs}

Try it online!

Ruby, 38 bytes

Function; List of digits

->n{s=0
n.map{|x|s+=x%2>0?x:-x}
s.abs}

Try it online!

edited Dec 16, 2017 at 15:07

answered Dec 16, 2017 at 14:48

Unihedron

1,28514 silver badges21 bronze badges

Add a comment |

ProgramFOX · Accepted Answer · 2017-12-16 15:50:03Z

1

Rust, 73 bytes

fn f(mut a:i32)->i32{let mut s=0;while a>0{s+=a%10*(a%2*2-1);a/=10}s.abs()}

Try it online!

Rust, 68 bytes

This takes a slice of digits rather than an integer.

fn z(a:&[i32])->i32{a.iter().map(|x|x*(x%2*2-1)).sum::<i32>().abs()}

Try it online!

edited Dec 16, 2017 at 15:50

answered Dec 16, 2017 at 15:37

ProgramFOX

8,3017 gold badges42 silver badges70 bronze badges

Add a comment |

FrownyFrog · Accepted Answer · 2017-12-16 17:25:14Z

1

J, 11 bytes

Credit to Uriel’s APL solution

1|@#.[*_1^]

Try it online!

answered Dec 16, 2017 at 17:25

FrownyFrog

3,6821 gold badge12 silver badges20 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Pyth, 16 12 11 10 8 bytes

.asm*^tZ

Try it online!

How?

.asm*^tZ – Full program. Q = input.
   m*^tZ – Raise -1 to the power of each d in Q and multiply by d.
  s      – Sum.
.a       – Absolute value.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 11, 2017 at 7:20

Mr. Xcoder

42.2k9 gold badges77 silver badges214 bronze badges

Add a comment |

naffetS · Accepted Answer · 2022-12-01 03:02:06Z

1

Vyxal, 6 bytes

u$eÞ•ȧ

Try it Online!

Port of Jelly.

u$eÞ•ȧ
u$e     # Raise -1 to the power of each
   Þ•   # Dot product with the input
     ȧ  # Absolute value

answered Dec 1, 2022 at 3:02

naffetS

11.9k2 gold badges16 silver badges47 bronze badges

Add a comment |

cnamejj · Accepted Answer · 2022-12-01 07:52:08Z

Ly, 24 bytes

0spSy[f:2%2*,*l+sp,]lar-

Try it online!

This is pretty brute force, it just adds or subtracts each number to an accumulator depending on whether it's odd or even. The post-loop bit is the shortest way to get an abs() in Ly I could think of.

0sp                       - initialize the backup cell to 0, clear stack
   S                      - convert the number on STDIN to digits on the stack
    y                     - push the number of digits onto the stack
     [f           ,]      - loop decrementing the digit count, stop on 0
       :                  - duplicate the next digit
        2%                - modulo by 2 to get odd/even
          2*,             - do "(x*2)-1" to map 1 to 1, and 0 to -1
             *            - multiple the digit by that 1/-1
              l+sp        - add to backup cell, pop from stack
                    l     - load the final difference from accumulator
                     a    - sort stack (has a 0 and the accumulator val)
                      r   - reverse stack
                       -  - subtract to flip the sign if difference was <0

The programs with a positive number on the stack, which is printed automatically.

Aiden Chow · Accepted Answer · 2022-12-01 08:01:41Z

1

Desmos, 24 bytes

f(l)=abs(total(l(-1)^l))

Input as a list of digits.

Try It On Desmos!

Try It On Desmos! - Prettified

answered Dec 1, 2022 at 8:01

Aiden Chow

11.7k1 gold badge11 silver badges49 bronze badges

Add a comment |

Dominic van Essen · Accepted Answer · 2022-12-01 11:03:16Z

Nibbles, 6 bytes (12 nibbles)

!=+$*+|$%$~~

Calculates the absolute difference between the sum of all digits and twice the sum of the odd digits.

!=+$*+|$%$~~
!=              # absolute difference between
  +             #   sum of 
   $            #   input
                # and
     +          #   sum of 
       $        #   input 
      |         #   filtered for nonzero when
        %$      #     modulo
          ~     #     2 (default for modulo)
    *           #   multiplied by
           ~    #   2 (default for multiplication)

Kevin Cruijssen · Accepted Answer · 2022-12-01 14:15:25Z

1

MathGolf, 6 bytes

b▬m*Σ±

Port of @Dennis' Jelly answer.

Input as a list of digits.

Try it online.

Explanation:

b      # Push -1
 ▬     # Take -1 to the power of each integer in the (implicit) input-list
  m*   # Multiply the values at the same positions of this list and the (implicit) input
    Σ  # Sum this list together
     ± # Get its absolute value
       # (after which the entire stack is output implicitly as result)

answered Dec 1, 2022 at 14:15

Kevin Cruijssen

118k10 gold badges134 silver badges361 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2022-12-01 16:16:54Z

1

Japt, 8 bytes

üv mx ra

Try it

Takes input as a digit array

üv mx ra     :Implicit input of digit array
ü            :Group by
 v           :  Divisible by 2?
   m         :Map
    x        :  Sum
      r      :Reduce by
       a     :  Absolute difference

answered Dec 1, 2022 at 16:16

Shaggy

40.6k4 gold badges32 silver badges90 bronze badges

Add a comment |

Seggan · Accepted Answer · 2022-12-01 16:28:56Z

1

Fig, \$6\log_{256}(96)\approx\$ 4.939 bytes

AS*^N1

Try it online!

Port of MathGolf. Surprisingly, beats Jelly.

AS*^N1 # Input as list of digits
    N1 # -1
   ^   # To the power of each in the input
  *    # Multiply the list of 1s and -1s by each digit
 S     # Sum
A      # Absolute value

answered Dec 1, 2022 at 16:28

Seggan

5,21120 silver badges47 bronze badges

Add a comment |

Jordan · Accepted Answer · 2022-12-01 16:53:29Z

1

J-uby, 33 bytes

:partition+:odd?|:*&:sum|+:-|:abs

Attempt This Online!

answered Dec 1, 2022 at 16:53

Jordan

9,2961 gold badge29 silver badges47 bronze badges

Add a comment |

naffetS · Accepted Answer · 2022-12-02 00:09:24Z

1

Pip, 9 bytes

AB$+g*vEg

Try It Online!

answered Dec 2, 2022 at 0:09

naffetS

11.9k2 gold badges16 silver badges47 bronze badges

Add a comment |

chunes · Accepted Answer · 2023-03-02 03:16:18Z

1

Arturo, 26 bytes

$=>[abs∑map&'x->x*^0-1x]

Try it

answered Mar 2 at 3:16

chunes

18.3k3 gold badges18 silver badges45 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2023-03-02 08:51:10Z

Thunno, \$ 9 \log_{245}(96) \approx \$ 7.41 bytes

D1n@z*SZA

Attempt This Online! or verify all test cases.

Explanation

D1n@z*SZA  # Implicit input        [1, 2, 3, 4]
D          # Duplicate             [1, 2, 3, 4], [1, 2, 3, 4]
 1n@       # Push -1 ** each       [1, 2, 3, 4], [-1, 1, -1, 1]
    z*     # Multiply elementwise  [-1, 2, -3, 4]
      S    # Sum this list         2
       ZA  # Absolute value        2
           # Implicit output

ElectricRouge · Accepted Answer · 2017-07-11 12:17:20Z

0

C#, 59 bytes

Math.Abs(a.Where(x=>(x%2<1)).Sum()-a.Where(x=>x%2>0).Sum())

answered Jul 11, 2017 at 12:17

ElectricRouge

101

\$\begingroup\$ You may want to add some kind of explanation for this. Just for the people who don't know C. As it is, it's kind of just the code. \$\endgroup\$
– Gryphon
Jul 11, 2017 at 12:57

Add a comment |

geokavel · Accepted Answer · 2017-07-12 06:45:51Z

0

CJam, 16 14 Bytes

q{si_W\#*}%:+z

Try it online

q{si_W\#     e# Take -1 to power of digit
*}%          e# Multiply result by digit 
:+z          e# Sum altered digits and return the absolute value

edited Jul 12, 2017 at 6:45

answered Jul 12, 2017 at 6:29

geokavel

6,6363 gold badges24 silver badges60 bronze badges

Add a comment |

Renzo · Accepted Answer · 2017-07-12 07:15:23Z

0

Common Lisp, 52 bytes

(defun f(x)(abs(loop as i in x sum(*(expt -1 i)i))))

Try it online!

Translation of Dead Possum answer.

edited Jul 12, 2017 at 7:15

answered Jul 11, 2017 at 8:02

Renzo

2,54811 silver badges22 bronze badges

Add a comment |

jahly · Accepted Answer · 2017-07-12 11:05:27Z

0

java , 314 bytes

public  static int f (String s)
{
    char [] m =s.toCharArray();
    int o=0 ,e=0; 
    for(int i =0 ;i<m.length;i++)
    { int n=(int)m[i]-48;
    if(n%2==0)
        e+=n;
    else 
        o+=n;
    }
    return abs(e-o);


   }

answered Jul 12, 2017 at 11:05

jahly

214 bronze badges

Add a comment |

tfantonsen · Accepted Answer · 2017-07-12 14:36:42Z

0

Java (OpenJDK 8), 64 bytes

Takes n as int input, uses mod 10 and div 10 to sum from least significant digit and return Absolute value when done.

n->{int r=0;for(;n>0;n/=10)r+=n%2>0?-n%10:n%10;return r<0?-r:r;}

Try it online

edited Jul 12, 2017 at 14:36

answered Jul 11, 2017 at 12:37

tfantonsen

12 bronze badges

1

\$\begingroup\$ Welcome to PPCG! Your TIO link doesn't seem to match your code, would you mind updating it? \$\endgroup\$
– musicman523
Jul 11, 2017 at 15:26
1

\$\begingroup\$ That TIO is actually my answer, but to another question! O_o \$\endgroup\$
– Olivier Grégoire
Jul 11, 2017 at 19:01
\$\begingroup\$ Fixed! and thanks for the welcome... \$\endgroup\$
– tfantonsen
Jul 12, 2017 at 14:37

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Bash, 51 bytes

Full program; Full number

Or "bash with awk" for the pedantics.

grep -o .|awk '{a+=$0%2?$0:-$0}END{print a<0?-a:a}'

Try it online!

Explanation

grep -o .| # every /./ on a new line
awk '{
            // a is initialized to 0 cuz awk lol
  a+=$0%2   // Is odd?
    ?$0:-$0 // true -> add +, false -> add -
}
END{
  print a<0?-a:a // to absolute value
}'

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Dec 16, 2017 at 14:35

Unihedron

1,28514 silver badges21 bronze badges

Add a comment |

Unihedron · Accepted Answer · 2017-12-16 14:39:41Z

0

AWK, 35 bytes

Full program; List of digits

{a+=$0%2?$0:-$0}END{print a<0?-a:a}

Try it online!

Technically not the same as my other answer. I still think that one is better because using a list of digits feels cheap.

answered Dec 16, 2017 at 14:39

Unihedron

1,28514 silver badges21 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

APL NARS 26 chars

{∣(+/-a)+2×+/(2∣a)/a←⍎¨⍕⍵}

test

  f←{∣(+/-a)+2×+/(2∣a)/a←⍎¨⍕⍵}
  f¨0 1 12 333 459 2469 1234
0 1 1 9 10 3 2

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Dec 17, 2017 at 14:18

user58988

Add a comment |

Stack Exchange Network

Subtract my odds from my evens

Default Rules

Test Cases

56 Answers 56

TI-BASIC, 11 6 bytes

J, 14 bytes

explanation

Tcl, 55 bytes

Ruby, 45 bytes

Ruby, 38 bytes

Rust, 73 bytes

Rust, 68 bytes

J, 11 bytes

Pyth, 16 12 11 10 8 bytes

How?

Vyxal, 6 bytes

Ly, 24 bytes

Desmos, 24 bytes

Nibbles, 6 bytes (12 nibbles)

MathGolf, 6 bytes

Japt, 8 bytes

Fig, \$6\log_{256}(96)\approx\$ 4.939 bytes

J-uby, 33 bytes

Pip, 9 bytes

Arturo, 26 bytes

Thunno, \$ 9 \log_{245}(96) \approx \$ 7.41 bytes

Explanation

C#, 59 bytes

CJam, 16 14 Bytes

Common Lisp, 52 bytes

Java (OpenJDK 8), 64 bytes

Bash, 51 bytes

Explanation

AWK, 35 bytes

APL NARS 26 chars

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
number
number-theory
or ask your own question.

Linked

Hot Network Questions

Subtract my odds from my evens

Default Rules

Test Cases

56 Answers 56

TI-BASIC, 11 6 bytes

J, 14 bytes

explanation

Tcl, 55 bytes

Ruby, 45 bytes

Ruby, 38 bytes

Rust, 73 bytes

Rust, 68 bytes

J, 11 bytes

Pyth, 16 12 11 10 8 bytes

How?

Vyxal, 6 bytes

Ly, 24 bytes

Desmos, 24 bytes

Nibbles, 6 bytes (12 nibbles)

MathGolf, 6 bytes

Japt, 8 bytes

Fig, \$6\log_{256}(96)\approx\$ 4.939 bytes

J-uby, 33 bytes

Pip, 9 bytes

Arturo, 26 bytes

Thunno, \$ 9 \log_{245}(96) \approx \$ 7.41 bytes

Explanation

C#, 59 bytes

CJam, 16 14 Bytes

Common Lisp, 52 bytes

Java (OpenJDK 8), 64 bytes

Bash, 51 bytes

Explanation

AWK, 35 bytes

APL NARS 26 chars

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfnumbernumber-theory or ask your own question.

Linked

Related

Hot Network Questions

Not the answer you're looking for? Browse other questions tagged
code-golf
number
number-theory
or ask your own question.