CareerCup

#include<stdio.h>
int func(int a,int cnt)
{
int ans=0;
if(cnt==0)
return 0;
ans=a+func(a,--cnt);
return ans;
}
main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",func(a,b));
}

{
private static int recMultiplyHelper(int x, int y)
{
if (y == 1)
return x;
else
return x + recMultiply(x, y - 1);
}

public static int Multiply(int x, int y)
{
if (x == 0 || y == 0)
return 0;
bool isAnswerNegative = false;
if (x < 0 && y > 0 || x > 0 && y < 0)
isAnswerNegative = true;
if (x < 0)
{
x = x - x - x;
}
if (y < 0)
{
y = y - y - y;
}
int answer = recMultiplyHelper(x, y);
if (isAnswerNegative)
{
answer = answer - answer - answer;
}
return answer;
}
}

Here is another version

int multiply(int a, int b) {
	if (a == 0 || b == 0) {
		return 0;
	}
	a += multiply(a, abs(b) - 1);
	return (b < 0) ? -1 * a : a;
}

nice one !

Just to make sure you are fixing one Integer and parsing another into function using recursion? Right?

int multiply(int a, int b)
{
int ans=0;

if(b==0)
{
return 0;
}

if(b>0)
{
a += multiply(a,--b);
}
else if(b<0) {
a = -a;
a -= multiply(a, ++b);

}
return a;
}

int multiply(int a, int b)
{
if (a == 0 || b == 0)
{
return 0;
}
if (abs(b) > abs(a))
{
return multiply(b, a);
}

return (b>0)? a+multiply(a, --b) : multiple(a, ++b) -a;
}

Reply to Comment