CareerCup

int divide(int divisor, int dividend) {

	int quotient = 0;
	while (divisor <= dividend) {
		dividend = dividend - divisor;
		quotient++;
	}
	return quotient;
}

public double Divide(double numerator, double denominator)
{
double temp = 1.0;

if (numerator == 0)
return 0;

if (numerator < denominator)
{
numerator *= 10;
temp = 0.1 * Divide(numerator, denominator);
numerator = denominator;
}

return temp + Divide(numerator - denominator, denominator);
}

in simple mathematics, multiplication is considered as advanced form of addition, and division is considered as advanced for of subtraction. In this case, I hope that though we're not supposed to use / or %, we can get away by using -

int sign(int a){
    return a<0;
}
 
int div(int a, int b){
    int A = abs(a);
    int B = abs(b);
 
    int counter =0;
    while((counter+1)*b<=a){
        counter++;
    }
 
    // one is negative
    if(sign(a)+sign(b)==1){
        counter =-counter;
    }
 
    return counter;
}

For this I went back to how we used to do multiplication and division by hand on paper, and implemented those algorithms... but in base2 using bit operations. Also special-cased zeros and negative numbers:

private static int multiply(int n1, int n2) {
	if (n1 == 0 || n2 == 0) return 0;
	if (n1 < 0 && n2 < 0) return multiply(-n1, -n2);
	if (n1 < 0) return -1 * multiply(-n1, n2);
	if (n2 < 0) return -1 * multiply(n1, -n2);
	
	int result = 0;
	int currentShift = 0;
	while ((n2 >> currentShift) > 0) {
		if ((1 & (n2 >> currentShift)) == 1) {
			result += n1 << currentShift;
		}
		currentShift++;
	}
	return result;
}

private static int divide(int divisor, int dividend) {
	if (divisor == 0) throw new IllegalArgumentException("Division by Zero");
	if (divisor < 0 && dividend >= 0) return -1 * divide(-divisor, dividend);
	if (divisor > 0 && dividend < 0) return -1 * divide(divisor, -dividend);
	if (divisor > dividend) return 0;
	
	long div = divisor;
	int currentShift = 0;
	while ((div << currentShift) < dividend) {
		currentShift++;
	}
	currentShift--;
	int result = 0;
	for (; currentShift >= 0; currentShift--) {
		if ((div << currentShift) <= dividend) {
			result |= (1 << currentShift);
			if ((div << currentShift) < dividend) {
				dividend -= (div << currentShift);
			} else {
				break;
			}
		}
	}
	return result;
}

import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author suryakarthik.v
 */
public class Division {
   static  int count=1;
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int count=1;
        System.out.println("give the dividend");
        double m=sc.nextDouble();
        System.out.println("Give the divisor");
        double n=sc.nextDouble();
        System.out.println("The quotient is "+quotient(m,n));
        System.out.println("The remainder is "+rem(m,n));
        ;
    }
  
    public static int quotient(double m,double n){
        
        double N=n;
        if(m<n)return 0;
        else if(m==n)return 1;
        else{
            for (;n<m-N; n=n+N) {
                count++;
            }
        }
        return count;
    }
    public static double rem(double m,double n){
        return m-n*count;
    }
}

void divide(int divisor,int divident)
{
int quotient=0,remainder,flag;
if(divident!=0)
{
if(divisor<0 && divident<0)
flag=1;
if(divisor<0 && divident>0)
flag=2;
if(divisor>0 && divident<0)
flag=3;
else
flag=4;

if(divisor<0)
divisor=-divisor;
if(divident<0)
divident=-divident;

while(divisor<0)
{
divisor-=divident;
quotient++;
}
remainder=divisor+divident;
if(flag==1)
remainder=-remainder;
if(flag==2)
{remainder=-remainder; quotient = -quotient;}
if(flag==3)
quotient=-quotient;

cout<<"Quotient: "<<quotient;
cout<<" Remainder: "<<remainder;
}

}

for (int i = 1, result = 0, a = 24, b = 3; i <= a; i += b) ++result;

int q=0;
while (a<b)
{b=b-a};
printf(q,b)

int q=0;
while (a<b)
{b=b-a;
q=q+1};
printf(q,b);


oops forgot to add that

import java.util.*;



class Divide{
	int num;
	int den;
	double ans;
	static double result=1;
	
	public static void main(String args[])
	{
		Divide obj=new Divide();
		Formatter fm=new Formatter();
		Scanner sc=new Scanner(System.in);
		System.out.println("enter num");
		obj.num=sc.nextInt();
		System.out.println("enter den");
		obj.den=sc.nextInt();
		obj.ans=1;
		if(obj.num>obj.den)
		{
			while(obj.num>obj.den)
			{
				obj.num=obj.num-obj.den;
				obj.ans++;
				
			}
		}
		else
		{
			while(obj.num<obj.den)
			{
				obj.num=obj.num*10;
				result=result/10;
				
			}
			while(obj.num>obj.den)
			{
				obj.num=obj.num-obj.den;
				obj.ans++;
				
			}
		}
		if(result>=1)
				{
					System.out.println("answer is "+obj.ans);
				}
				else
				{
					System.out.println("answer iss "+obj.ans*result);
					System.out.println(fm.format("answer is %1f",obj.ans*result));
				}
	}
}

package com.java;

import java.math.*;

public class Divide {

public static void main(String[] Args){

int divident=0,divisor=0,res=1,i=1;
boolean flag=false;

//if(Integer.parseInt(Args[0])>Integer.parseInt(Args[1])){

divident=Integer.parseInt(Args[0]);
divisor=Integer.parseInt(Args[1]);
//}
//else{
// divident=Integer.parseInt(Args[1]);
// divisor=Integer.parseInt(Args[0]);
//}
if(divident<0 ){

divident=0-divident;
flag=true;
}
if(divisor<0){
divident=0-divident;
flag=true;
}
if(( divident<0 && divisor<0)){

divident=0-divident;
divident=0-divident;
}


res=divident-divisor;
while(true){

if(divisor>0){

//res=divident-(divisor*i);
//i++;

if(res==0 || res==1){
if(flag)
i=-i;

System.out.println("divide// "+i);
break;
}
else if(res <0){

i--;
if(flag)
i=-i;

System.out.println("divide// "+ (i));
break;

}
res=res-divisor;
i++;
}
else{

System.out.println(divisor);
break;
}
}
System.out.println("Modulo%% "+res);

}


}

public int divide(int numerator, int denominator) {
        int value = 0;
        int sign = 1;
        if (numerator == 0) {
            return value;
        }
        if (denominator == 0) {
            System.out.println("Infinity");
            return -1;
        }
        if (numerator < 0 || denominator < 0) {
            sign = -1;
            if (numerator < 0) {
                numerator *= -1;
            }
            if (denominator < 0) {
                denominator *= -1;
            }
        }

        while (numerator >= denominator) {
            numerator -= denominator;
            value++;
        }
        return value * sign;
    }

public class DivisionDemo {
public static void main(String args[]){
int a=100;
int b=5;
int c=0;
int d=b;
while(a>=d){
d+=b;
c++;
}
System.out.println(c);
}

}

public static void divide(int dividend, int divisor) {
		int quotient = 0;
		for(int tempDividend = 0;tempDividend<=divisor;tempDividend++) {
			
			if (tempDividend == divisor) {
				quotient++;
				tempDividend=0;
				dividend = dividend - divisor;
			}
			if(dividend<divisor) {
				System.out.println("remainder:"+dividend);
				break;
			}
		}
		System.out.println("quotient:"+quotient);

}

private static double Divide(int numerator, int denominator)
        {
            double result = 0;

            if (numerator != 0 && numerator < denominator)
            {
                result = .1 * Divide(numerator * 10, denominator);
            }

            if (numerator - denominator >= denominator || numerator - denominator >= 0)
            {
                numerator -= denominator;
                result = Divide(numerator, denominator);

                result++;
            }

            return result;
        }

public class demo {
public static void main(String args[]){
int x=6,y=10;

System.out.println(x+y>>1);
}
}

public class demo {
public static void main(String args[]){
	int x=6,y=10;
	
	System.out.println(x+y>>1);
}
}

public static double divide(int numerator, int denominator)
{
int res = 0, q = 0;
if(numerator<denominator)
{
numerator = numerator * 10;
return 0.1 * divide(numerator, denominator);
}
while (numerator >= denominator)
{
numerator = numerator - denominator;
res++;
}
if (numerator > 0)
q = numerator;

return res;
}

#include <iostream>
using namespace std;

int main(){
	// a is the numerator, b is the denominator
	int a, b;
	int count = 0;
	cin>>a>>b;
	while(a != 0){
		a = a - b;
		count++;
	}
	cout<<count;
	return 0;
}

Can anyone suggest what can be done for the case when the numerator is not completely divisible by the denominator. Also, what about division of floating point numbers? Which basically means, what if the answer is a floating point number?

in Java -

public class DivisionWithoutOperator {

	public static void main(String[] args) {

		int x1 = 13, x2 = 5;

		int divisor = (x1 > x2) ? x2 : x1;
		int dividend = (x1 > x2) ? x1 : x2;
		int multiplier = 1, quotent;
		while (true) {
			if ((divisor * multiplier) > dividend) {
				quotent = multiplier - 1;
				break;
			} else
				multiplier++;

		}

		System.err.println("Division result = " + quotent);
	}

}

public class DivisionWithoutOperator {

public static void main(String[] args) {

int x1 = 13, x2 = 5;

int divisor = (x1 > x2) ? x2 : x1;
int dividend = (x1 > x2) ? x1 : x2;
int multiplier = 1, quotent;
while (true) {
if ((divisor * multiplier) > dividend) {
quotent = multiplier - 1;
break;
} else
multiplier++;
}

System.out.println("Division result = " + quotent);
}

}