Answer by sergiol for Implement division using only addition
Tcl, 96 bytes, a additionswhere a is the divisor.Non-competing, but I just wanted to have fun.proc M f\ g { time {incr p $f} $g set p}proc D p\ f { while {[M [incr i] $f]<$p} {}set i}Try it online!
View ArticleAnswer by madeforlosers for Implement division using only addition
jBasher2, \$(a/b)+ab \$ additions, 333 bytes(where a is the dividend and b is the divisor)create a with type numbercreate b with type numbercreate c with type numbercreate d with type numbercreate e...
View ArticleAnswer by madeforlosers for Implement division using only addition
CASIO BASIC (CASIO fx-9750giii), \$(a/b)+ab\$ additions, 40 bytes?→A?→BWhile D<AIsz CFor 0→E~D To BC+D→DNextWhileEndCtranslation of my answer in jBasher2
View ArticleImplement division using only addition
There is a question on the site that asks to implement division without using division.In my case, I am asking you to do the same, but only using addition.What this means is basically: addition is the...
View ArticleAnswer by Joe Z. for Implement division using only addition
Python, 320703 additionsdef divide(a, b): quotient = 0 c = 0 d = 0 while add(d, b) <= a: c = add(c, 1) d = add(d, b) return cAs always, a last-place reference answer. This simply adds 1 to a...
View ArticleAnswer by Johannes Kuhn for Implement division using only addition
Tcl, 0 additionsproc divide {a b} { set sa [string repeat . $a] set sb [string repeat . $b] set sr "" while 1 { append sc $sb if {[string le $sc]>[string le $sa]} break append sr . } return [string...
View ArticleAnswer by Johannes Kuhn for Implement division using only addition
Tcl, 0 additions.Well, I had to find a way that does not use other data structures but is still not what you want:# coroutine counter.proc ccnt {} {yield [info level]; ccnt}# add implementation without...
View ArticleAnswer by aaaaaaaaaaaa for Implement division using only addition
Writing rules is hard, these rules in particular contain incentive to avoid additions at all costs.Is there a prize for the most ridiculous answer?JavaScript - 0 additionsNow with fallback method that...
View ArticleAnswer by DavidC for Implement division using only addition
Mathematica 100201 additionsThis adds the divisor, b, to c (which is initialized at 0) as long as the running total is less than or equal to the dividend, a. It also appends the current value of c to a...
View ArticleAnswer by Anurag for Implement division using only addition
Use this implementation in java, 199206 additionspublic int divide(int a, int b){ int counter = 0; int c = 0; if(b==1){ return a; } if(a==b){ return 1; } else{ boolean done = false; while(!done){ c =...
View ArticleAnswer by Parag for Implement division using only addition
C++ ,100201for(int a = 1; a<=200; a++){ for(int b=1;b<=a;b++){ iter1 = iter2 = b; cout<<a<<""<<b<<endl; c1 =0;while(iter1 <= a){ iter1 = iter1 + iter2; c1 ++;...
View ArticleAnswer by Dinesh Kumar P for Implement division using only addition
//a lies between 1 and 200, b lies between 1 and a.int divide(int a,int b){int x=a,y=b;int count=1;while(y<x){y+=y;count++;}return count;}
View ArticleAnswer by plannapus for Implement division using only addition
R - 0 additiondivide<-function(a,b){ options(warn=-1) A<-matrix(1:b,nrow=a,ncol=1) length(split(A,A)[[b]]) }Uses R vector recycling.Second line creates a matrix of length a populated by a vector...
View ArticleAnswer by gnibbler for Implement division using only addition
Python - 0 additionsfrom itertools import repeat, countdef divide(a, b): i = repeat(0, a) try: for j in count(): for k in repeat(0, b): next(i) except: return jThis uses an iterator of length a, and...
View ArticleAnswer by Igby Largeman for Implement division using only addition
C# - 0 additionsusing System.Collections.Generic;using System.Linq;static int Divide(int a, int b){ var ints = new List<int>(a); while (ints.Count < a) ints.AddRange(Enumerable.Range(1, b));...
View ArticleAnswer by ST3 for Implement division using only addition
My solution is C/C++ code and it makes many additions (200402), but anyway...#include <iostream>int total = 0;int sum(int a, int b){++total; return a + b;}int divide(int a, int b){ int x = 1; if...
View ArticleAnswer by Cary Swoveland for Implement division using only addition
In Ruby,def divide(a,b) n, d = 'x' * a, 'x' * b l = [] (l << 'x'; d << 'x' * b) while n.size >= d.size l.sizeend I don't know TCL, but I suspect this is the same approach as @Johannes '...
View ArticleAnswer by Joop Eggen for Implement division using only addition
Java: 92 987 additionsI use binary recursion, that a/b == 2 * a/(2b) + maybe 1. For that divisor and remainder are needed. There would normally be a subtraction a % (2b) - b, but that is resolved by...
View ArticleAnswer by Alexei Kopylov for Implement division using only addition
Haskell 0 additions, 29 bytesn/m=[i|i<-[0..],_<-[1..m]]!!nthis redefines the division operator (/). it works by making a list of 0 to infinity where each item is repeated m times, and then...
View ArticleAnswer by Todd Lehman for Implement division using only addition
C — 85591 AdditionsHere we go. I think this might be optimal. It uses a technique of "reverse division" whereby through long multiplication it builds up the largest number q such that q * b <= a,...
View Article![ONEW – KAKERA -Unmei no Piece- – EP [iTunes Plus M4A]](http://is1-ssl.mzstatic.com/image/thumb/Music221/v4/d0/fb/86/d0fb86a5-ba60-4bea-41fb-7f54c125f518/VEATP-45908.jpg/296x296bb.webp)
/pic9814888.png)
