Adding without using a + or - sign [closed]

Question

There have been many "Do __ without __" challenges before, but I hope that this is one of the most challenging.

The Challenge

You are to write a program that takes two natural numbers (whole numbers > 0) from STDIN, and prints the sum of the two numbers to STDOUT. The challenge is that you must use as few + and - signs as possible. You are not allowed to use any sum-like or negation functions.

Examples

input

123
468

output

591

input

702
720

output

1422

Tie Breaker: If two programs have the same number of + and - characters, the winner is the person with fewer / * ( ) = . , and 0-9 characters.

Not Allowed: Languages in which the standard addition/subtraction and increment/decrement operators are symbols other than + or - are not allowed. This means that Whitespace the language is not allowed.

Answer 1

Python 42

a,b=input()
print eval("~-"*a+"~-"*b+"0")

Seven tie breakers, but those are string operations

Answer 2

C#, 12 tiebreakers (), 3 tiebreakers .

using System;
using System.Data;

class Program {
  static string ReadLine { get { return Console.ReadLine(); } }
  static void Main(string[] args) {
    Console.Out.Write(
     new DataTable().Compute(string.Join("\u002b", 
     ReadLine,
     ReadLine), "")
    );
  }
}

Answer 3

JavaScript 69

My attempt, using bitwise operators

for(x=(z=prompt().split(" "))[0],y=z[1];y;)x^=y,y=(y&x^y)<<1;alert(x)

Answer 4

R, 44 bytes

nchar(paste(strrep(" ",scan()),collapse=""))

Try it online!

Converts the two inputs to unary and "sums" via concatenation. Check out the other R answers:

• Using sequence
• Using dot product

Answer 5

C, score 0 with 8 tie-breakers

f(a,b) { return b ? f(a^b, a<<1 & b<<1) : a; }
 ^ ^ ^               ^   ^    ^      ^^

I've highlighted the tie-break chars.

Negative numbers are assumed to be 2s-complement.

Answer 6

Javascript (ES6) - 8 Tie-breaker characters

add: {
    let a = prompt``|false;
    let b = prompt``|false;
    while (a & b) {
        a = a ^ b;
        b = [b & ~a][false|false] << true
    }
    alert(a | b);
}

• 2 * (
• 2 * )
• 4 * =

Answer 7

Runic Enchantments, (no +/-, 1 tie-breaker, 11 bytes)

'V2,k!$wi|;

Try it online!

Not allowed to have + characters? Fine, I'll create them myself with math and reflection. V has the byte value 86, which gets divided by 2 (the , and only tie-breaker character) converted to a character, and finally, reflectively written into the program under the instruction pointer. It then reads input, hits a reflector (|), reads input again, then reaches the space originally containing a w and adds them together before printing. The IP then performs an illegal action at , and is silently terminated.

Is this cheating? Probably. But the challenge says "don't use + characters" and the source code contains 0 of them.

Alternate method, (no +/-, 3 tie-breakers, 16 bytes)

"ab"1,i*}i*qul$;

Try it online!

Makes two strings, one of length x and one of length y, concatenates them together, then computes the length of the string. Does this count as a "sum-like function"? Perhaps. + on two strings does do the same thing.

Answer 8

APL (Dyalog Unicode), 4 bytes^SBCS, 0 +/-, 0 tie breakers

Can sum any number of non-negative integers.

≢⎕⌿#

Try it online!

# reference to the root object

⎕/ replicate by the number(s) from STDIN
^{for each number, we get that many copies of the corresponding element on the right, but since there is only one, all numbers get paired up with that one, forming a single list of N₁+N₂+…+N_n references}

≢ tally

Output is implicitly to STDOUT.

Answer 9

Gol><>, 12 bytes

IITM:{P}?trh

Thanks to JoKing for reminding me there was a Teleport Pad!!

1st version, 25 bytes

II!/M:{P}?\rh
   \     :/

Try it online!

This was alot easier than I thought it would be!!! I will be golfing this alot more!!!

Answer 10

MathGolf, 3 bytes, 0 +/-

α▓∞

Try it online!

While perhaps violating the spirit of the "no sum" rule, this solution wraps the inputs into an array, calculates the average of the values in that array, and duplicates the result. Of course, the avg operator uses a sum internally, but its behavior is inherently different compared to the sum operator Σ.

The output is printed as a float, with .0 at the end. If this is not acceptable, just add i to the end to convert it back into an integer.

Explanation

α     wrap last two elements in array
 ▓    get average of list
  ∞   pop a, push 2*a

Answer 11

Befunge-98 (FBBI), 4 bytes, one +.

&&+.

Try it online!

Answer 12

Befunge-98 (PyFunge), 0 +/- characters, 0 tiebreaker characters, 47 bytes

brqzzzzzzzzzzzzzzzzzzzpyadgyacpyappyacybyabybay

Try it online!

Made all out letters, because why not?

More readable variant that does pretty much the same thing:

b<@                               &&pyapyabybay

Abuses the y GetSysInfo command, which can be used to retrieve the instruction pointer's current X coordinate. This is used to push the ASCII codes for + (add) and . (output), which later get put onto the field.

Answer 13

C (gcc), 3 tiebreakers

I take no credit for this, as this is not an original answer, but merely an amalgamation of the following answers to this same challenge:

https://codegolf.stackexchange.com/a/5701/97511, https://codegolf.stackexchange.com/a/4613/97511

#include <stdio.h>

#define OP (
#define CP )
#define CO ,

int main OP ac CO av CP int ac; typeof OP "" CP av; {
    scanf OP "%d\n%d" CO &ac CO &av CP;
    return printf OP "%d\n" CO &av[ac] CP;
}

Try it online!

Answer 14

Raku, 0 tie-breaker characters

say ½−½−$_ given ½−½−get−get

Try it online!

− here is the Unicode character MINUS SIGN at codepoint 8722, rather than the ASCII/Unicode character -, HYPHEN-MINUS, at codepoint 45. The two are synonymous in Raku, but the former is by no stretch the "standard" subtraction operator.

½−½− is how I'm negating numbers without using any of the tiebreaking characters. It could be done with just a single leading MINUS SIGN, but that could arguably be considered a "negation function."

Answer 15

Julia 1.0, no +/-, 1 tiebreaker

import Base:Meta.parse
["a"^[readline|>map|>parse][] "b"^[readline|>map|>parse][]]|>join|>length|>show

Try it online!

• "a"^N creates a string of length N
• x|>f is equivalent to f(x)
• f|>map calls f with no argument (f())
• [...][] is equivalent to parenthesis
• we join both strings and check for the total length

Julia 1.0 (function), no +/-, no tiebreaker

x->["a"^[x|>first][] "b"^[x|>last][]]|>join|>length

Try it online!