为什么第二个点too many or too few lines？

#include<iostream>
using namespace std;
long long   n,maxx,maxy,i,sum[10000],kx,ky;
struct node
{
    long long  x;
    long long  y;
}a[2001];
void mul(long long x)
{
    long long  g=0,i;
    for (i=1;i<=sum[0];++i)
    {
        sum[i]=sum[i]*x+g;
        g=sum[i]/10;
        sum[i]=sum[i]%10;
    }
    while  (g!=0)
    {
        ++sum[0];
        sum[sum[0]]=g%10;
        g/=10;
    }
}
void divv(int x)
{
    long long  num=0,i=sum[0]+1;
    while (num<x)
    {
        --i;
        num=num*10+sum[i];
    }
    for (;i>=1;--i)
    {
        cout<<num/x;
        num=num%x*10+sum[i-1];
    }
}
int main()
{
    int x,y;
    cin>>n;
    cin>>kx>>ky;
    sum[1]=kx;
    sum[0]=1;
    for (i=1;i<=n;++i)
    {
        cin>>x>>y;
        mul(x);
        if (x*y>maxx*maxy)
        {
            maxx=x;
            maxy=y;
        }
    }
    divv(maxx*maxy);
}