Dividing numbers using recursion

[dvdbeedy]

So i need to write a function that divides 2 numbers and gives a remainder and a quotient using recursion, but without any loops or division or mod operator. This is what i have so far, but i need to know what to do with &quotient, and &remiander. I cant modify main() in anyway, just need to write the function.

void divide(int dividend, int divisor, in &quotient, int &remainder)
{
if( divisor == 0 )
{
return 0;
}
else if(dividend - divisor == 0)
{
return 1;
}
else if( dividend< divisor)
{
return 0; }
else
{
return ( 1 + divide(dividend-divisor, divisor) );
}
}
int main()
{
int x,y;
divide(65,12,x,y);
return 0:
}