hdu 2462(欧拉定理+高精度快速幂模)

The Luckiest number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 980    Accepted Submission(s): 301

Problem Description

Chinese
people think of '8' as the lucky digit. Bob also likes digit '8'.
Moreover, Bob has his own lucky number L. Now he wants to construct his
luckiest number which is the minimum among all positive integers that
are a multiple of L and consist of only digit '8'.

 

Input

The input consists of multiple test cases. Each test case contains exactly one line containing L(1 ≤ L ≤ 2,000,000,000).

The last test case is followed by a line containing a zero.

 

Output

For
each test case, print a line containing the test case number( beginning
with 1) followed by a integer which is the length of Bob's luckiest
number. If Bob can't construct his luckiest number, print a zero.

 

Sample Input

8
11
16
0

 

Sample Output

Case 1: 1
Case 2: 2
Case 3: 0

做这个题的前提有两个公式：1.(a/b)%mod = a%(b*mod)/b%mod  2.待证明的公式： ax%b = 0 => a%(b/gcd(x,b)) 详情参见我的上一篇博客

这个题我们可以化成 (8*(10^k-1)/9)%L = 0 ---->  8*(10^k-1)%(9*L) 求出 d = gcd(9*L)

然后根据2化成 (10^k-1) % (9*L/d) => (10^k)%(9*L) = 1 又可以根据欧拉定理来求解了。。和我的上一题差不多。。但是这个题更坑，pow_mod是满足不了精度的，总之

参考了n多博客和资料才弄出这题。。高精度快速幂模模板get

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
typedef long long LL;
LL e[][];
LL phi(LL x)
{
    LL ans=x;
    for(LL i=; i*i<=x; i++)
        if(x%i==)
        {
            ans=ans/i*(i-);
            while(x%i==) x/=i;
        }
    if(x>)
        ans=ans/x*(x-);
    return ans;
}
LL gcd(LL a,LL b)
{
    return b==?a:gcd(b,a%b);
}
void devide(LL ans,int &id)
{
    for(LL i=; i*i<=ans; i++) ///分解质因数
    {
        if(ans%i==)
        {
            e[id][]=i;
            e[id][]=;
            while(ans%i==) ans/=i,e[id][]++;
            id++;
        }
    }
    if(ans>)
    {
        e[id][]=ans;
        e[id++][]=;
    }
}
LL modular_multi(LL a, LL b, LL c) {/// a * b % c
    LL res, temp;
    res = , temp = a % c;
    while (b) {
        if (b & ) {
            res += temp;
            if (res >= c) {
                res -= c;
            }
        }
        temp <<= ;
        if (temp >= c) {
            temp -= c;
        }
        b >>= ;
    }
    return res;
}
LL modular_exp(LL a, LL b, LL c) { ///a ^ b % c 改成mod_pow就不行，中间发生了溢出，还是这个模板靠谱
    LL res, temp;
    res =  % c, temp = a % c;
    while (b) {
        if (b & ) {
            res = modular_multi(res, temp, c);
        }
        temp = modular_multi(temp, temp, c);
        b >>= ;
    }
    return res;
}
int main()
{
    LL l;
    int t= ;
    while(~scanf("%lld",&l),l)
    {
        printf("Case %d: ",t++);
        LL d = gcd(,*l);
        LL a = *l/d;
        if(gcd(a,)!=){
            printf("0\n");
        }else{
            LL ans = phi(a);
            int id = ;
            devide(ans,id);
            for(int i=;i<id;i++){
                for(int j=;j<e[i][];j++){
                    if(modular_exp(,ans/e[i][],a)==) ans/=e[i][];
                }
            }
            printf("%lld\n",ans);
        }
    }
    return ;
}