2393: Cirno的完美算数教室
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 394 Solved: 231
[ Submit][ Status][ Discuss]
Description
Input
Output
Sample Input
Sample Output
58
解题思路:先可以枚举出baka数,然后再删掉两两可以整除的。
然后在dfs,加点剪枝,就是当lcm>r时直接退出。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
long long l,r,len,cnt,ans;
long long q[2000],g[2000];
bool b[2000];
inline long long read()
{
char y; long long x=0,f=1; y=getchar();
while (y<'0' || y>'9') {if (y=='-') f=-1; y=getchar();}
while (y>='0' && y<='9') {x=x*10+int(y)-48; y=getchar();}
return x*f;
}
long long gcd(long long a,long long b)
{
if (b==0) return a;
else return gcd(b,a%b);
}
void dfs(long long sum)
{
if (sum>r) return;
if (sum!=0)++len,q[len]=sum;
dfs(sum*10+2);
dfs(sum*10+9);
}
void work(long long sum,int ge,int now)
{
if (sum>r) return;
if (now==cnt+1)
{
if (sum!=1) {if (ge%2==1)ans+=r/sum-(l-1)/sum; else ans-=r/sum-(l-1)/sum;}
return;
}
long long ogg=gcd(sum,g[now]);
work(sum*g[now]/ogg,ge+1,now+1);
work(sum,ge,now+1);
}
int main()
{
l=read(); r=read();
dfs(0);
memset(b,true,sizeof(b));
for (int i=1;i<=len;++i)
for (int j=1;j<=len;++j)
if (i!=j && q[i]%q[j]==0) b[i]=false;
for (int i=1;i<=len;++i)
if (b[i])
{
++cnt; g[cnt]=q[i];
}
ans=0;
work(1,0,1);
printf("%lld",ans);
}