题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1340
题意:给你一个n,一个t,n!在b进制下末尾0的个数要大于等于t,求最大的d
思路:筛n之内的素数,然后依次看在素数p进制下0的个数,如果大于,快速幂优化
ac代码:
/*LightOJ 1340*/
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define MOD 10000019
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#define eps 1e-8
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll mod){ll ans=1;while(b){if(b%2)ans=ans*a%mod;a=a*a%mod;b/=2;}return ans;}
double dpow(double a,ll b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
int prime[MAXN],v[MAXN];
int cnt;
void db()
{
cnt=0;v[1]=1;
for(int i=2;i<=100000;i++)
{
if(!v[i])
{
prime[cnt++]=i;
for(int j=i*2;j<=100000;j+=i)
v[j]=1;
}
}
}
int main()
{
db();
int t,cas=0,i;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
int ans=1;
for(i=0;i<cnt;i++)
{
int k=n,ccnt=0;
while(k)
k/=prime[i],ccnt+=k;
//cout<<prime[i]<<" "<<ccnt<<endl;
//cout<<ccnt<<endl;
if(ccnt>=m)
ans=ans*powmod(prime[i],ccnt/m,MOD)%MOD;
else
break;
}
if(ans==1)
ans=-1;
printf("Case %d: %d\n",++cas,ans);
}
return 0;
}