题目地址:https://www.lydsy.com/JudgeOnline/problem.php?id=1853
if((double)xxxxx[x]<=r)
if(xxxxx[x]>0&&xxxxx[x]<=r ) ///爆long long
dfs(x+1,y+1,xxxxx[x]);
两种爆longlong的处理方法
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
long long ans[10000];
bool vis[10000];
long long xx[1000];
long long r,l,summ;
int sum=0;
int cnt=0;
long long gcd(long long a,long long b)
{
if(a<b)
swap(a,b);
//printf("*&&*\n");
if(b==0)
return a;
else
return gcd(b,a%b);
//printf("*&&*\n");
}
void digui(long long n)
{
if(n>r) return;
ans[cnt++]=n;
digui(n*10+6);
digui(n*10+8);
}
void dfs(int x,int y,long long z)
{
if(x>sum)
{
if(!y) return;
if(y&1)
summ+=(r/z)-(l-1)/z;
else
summ-=(r/z)-(l-1)/z;
return;
}
//printf("*&&*\n");
dfs(x+1,y,z);
long long xxx=z/gcd(xx[x],z);
// if((double)xxx*xx[x]<=r)i
if(xxx*xx[x]>0&&xxx*xx[x]<=r)///爆long long
dfs(x+1,y+1,xxx*xx[x]);
}
/*
dfs(now+1,chose,val);
ll tmp=val/gcd(lucky[now],val);
if((double)tmp*lucky[now]<=r)
{
dfs(now+1,chose+1,tmp*lucky[now]);
}
*/
int main()
{
scanf("%lld%lld",&l,&r);
digui(0);
//printf("**\n");
sort(ans+1,ans+cnt);
for(int i=1;i<cnt;i++)
{
if(!vis[i])
{
xx[++sum]=ans[i];
for(int j=i+1;j<cnt;j++)
{
if(ans[j]%ans[i]==0)
{
vis[j]=1;
}
}
}
}
// printf("**\n");
for(int i=1;i<=sum/2;i++)
swap(xx[i],xx[sum-i+1]);
dfs(1,0,1);
printf("%lld\n",summ);
return 0;
}