Divislors mylast

#include<bits/stdc++.h>
using namespace std;

#define M 1000000

bool mark[M];

vector<int>prime;

void sieve()
{
    int i,j;
        prime.push_back(2);
        for(i=3;i*i<M;i+=2)
        {
            if(mark[i]==false)
            {
                for(j=i*i;j<M;j+=2*i)
                    mark[j]=true;
            }
        }
        for(i=3;i<M;i+=2)
        {
            if(mark[i]==false)
                prime.push_back(i);
        }

}
int divisor(int n)
{
    int i,val,count,sum;
    sum=1;
    for(i=0;prime[i]*prime[i]<n;i++)
    {
        if(n%prime[i]==0)
        {
            count=0;
            while(n%prime[i]==0)
            {
                n/=prime[i];
                count++;
            }
            sum*=(count+1);
        }
    }
    if(n>1)
        sum*=2;
    return sum;
}




int main()
{
    sieve();
    int n,i,m,l,h,k;
    scanf("%d",&n);
    while(n--)
    {

    scanf("%d %d",&l,&h);
    int best=0,index=0;
    for(int i=l;i<=h;i++)
    {

        k=divisor(i);
       if(k>best)
       {
           best=k;
           index=i;
       }
    }
    printf("Between %d and %d, %d has a maximum of %d divisors.\n",l,h,index,best);
    }

    return 0;

}