大整数乘法

大整数真是一块脑疼的模块，看了下别人的代码，超六；
把一个数分成一半继续，就这样递归。。。

#include<iostream>
#include<cmath>
using namespace std;
#define SIGN(A) ((A > 0) ? 1 : -1)
int IntegerMultiply(int X, int Y, int N)
{
    int sign = SIGN(X) * SIGN(Y);
    int x = abs(X);
    int y = abs(Y);
    if((0 == x) || (0 == y))
        return 0;
    if (1 == N)
        return x*y;
    else
    {
        int XL = x / (int)pow(10., (int)N/2);
        int XR = x - XL * (int)pow(10., N/2);
        int YL = y / (int)pow(10., (int)N/2);
        int YR = y - YL * (int)pow(10., N/2);

        int XLYL = IntegerMultiply(XL, YL, N/2);
        int XRYR = IntegerMultiply(XR, YR, N/2);
        int XLYRXRYL = IntegerMultiply(XL - XR, YR - YL, N/2) + XLYL + XRYR;
        return sign * (XLYL * (int)pow(10., N) + XLYRXRYL * (int)pow(10., N/2) + XRYR);
    }
}
int  main()
{
    int x ;
    int y ;
    while(cin>>x>>y){
    cout<<"x * y = "<<IntegerMultiply(x, y, sizeof(x))<<endl;
    cout<<"x * y = "<<x*y<<endl;
    }
    return 0;
}