P1221 WA58pts 求助

#include<bits/stdc++.h>
#define int long long
using namespace std;
int l,r;
int ans=1;
int maxtms=1;
int prime[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
void dfs(int dep,int cur,int tms,int lst)
{
	if((tms>maxtms || (tms==maxtms&&cur<=ans)) && cur>=l && cur<=r)
	{
		maxtms=tms;
		ans=cur;
	} 
	if(dep>=16) return ;
	int p=prime[dep];
	for(int i=0;i<=lst;i++)
	{
		if(cur>r) break;
		dfs(dep+1,cur,tms*(i+1),i);
		cur=cur*p;
	}
}
signed main()
{
	cin>>l>>r;
	dfs(0,1,1,31);
	printf("Between %lld and %lld, %lld has a maximum of %lld divisors.",l,r,ans,maxtms);
}