Recursive algorithm, please help!

[kradragon94]

Just stucked in this little excercise, compile fine but running and it crashes

#include <iostream>

using namespace std;

long pow(int, int);

main()
{
    int x, y;
    cout << "Input two number x and y: ";
    cin >> x, y;
    cout << "Result of x^y is " << pow(x, y);
}

long pow(int x, int y)
{
    if (y > 1)
    {
        return x * pow(x, y-1);
    }
    return x;
}

[Olysold]

cin >> x, y;

Suppose to be

cin >> x >> y;

[kradragon94]

Thank, it worked. ^^

[vlad from moscow]

You should take into account the case when y is equal to 0. For example

#include <iostream>

int main()
{
	struct pow
	{
		long long operator ()( int x, unsigned int y ) const
		{
			if ( y ) return ( x * ( *this )( x, --y ) );
			else return ( 1 );
		}
	};

	std::cout << "2 ^ 4 = " << pow()( 2, 4 ) << std::endl;
}