HDU-3307-Description has only two Sentences（欧拉定理）

最新推荐文章于 2020-09-23 19:32:06 发布

Herod_

最新推荐文章于 2020-09-23 19:32:06 发布

阅读量164

点赞数

分类专栏：数论算法练习文章标签：数论

本文链接：https://blog.csdn.net/qq_43461168/article/details/108410187

版权

算法练习同时被 2 个专栏收录

227 篇文章 2 订阅

订阅专栏

数论

26 篇文章 0 订阅

订阅专栏

Description has only two Sentences

Problem Description

aⁿ = X*a_n-1 + Y and Y mod (X-1) = 0.
Your task is to calculate the smallest positive integer k that a_k mod a₀ = 0.

Input

Each line will contain only three integers X, Y, a₀ ( 1 < X < 2³¹, 0 <= Y < 2⁶³, 0 < a₀ < 2³¹).

Output

For each case, output the answer in one line, if there is no such k, output “Impossible!”.

Sample Input

2 0 9

Sample Output

解题思路：

题意很简单。
做法也很简单。
这个公式很容易写出通式：a_k=X^k*a₀+ $\sum_{i=0}^{k-1}X^i$ *Y
然后化简一下，等比数列公式 a_k=X^k*a₀+ $\frac{X^k-1}{X-1}$ *Y
同时a_k mod a₀那么 X^k*a₀ mod a₀显然等于0。直接拿掉。
再看剩下的 $\frac{X^k-1}{X-1}$ *Y 题目有Y mod (X-1) == 0 ，即Y是X-1的倍数那么直接约分。
令 m = Y/(X-1)，上式于是变成 a_k = (X^k-1)*m
再用一次模消去定律：即 (X^k-1)*m mod a₀ == (X^k-1) mod a₀/gcd(a₀,m)
令 P = a₀/gcd(a₀,m)，即 X^k==1 (mod P)
这不就是欧拉定理嘛！
显然若gcd(X,P) != 1 上式无解。
否则 k = φ（P）

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) print f("%d\n", n)
#define pc(n) print f("%c", n)
#define pdd(n,m) print f("%d %d", n, m)
#define pld(n) print f("%int d\n", n)
#define pldd(n,m) print f("%int d %int d\n", n, m)
#define sld(n) scanf("%int d",&n)
#define sldd(n,m) scanf("%int d%int d",&n,&m)
#define slddd(n,m,k) scanf("%int d%int d%int d",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int  i=a;i<=n;i++)
#define per(i,a,n) for(int  i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define aint (x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
#define pii map<int ,int >
#define mk make_pair
#define rtl rt<<1
#define rtr rt<<1|1
#define Max(x,y) (x)>(y)?(x):(y)
#define int long long


typedef pair<int ,int > PII;
typedef long long ll;
typedef unsigned long long uint ;
typedef long double ld;
const int  MOD = 1e9 + 7;
const int  mod = (1ll<<63);
const double eps = 1e-9;
const int  INF = 0x3f3f3f3f3f3f3f3f;
//const int  inf = 0x3f3f3f3f;
inline int  read(){int  ret = 0, sgn = 1;char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')sgn = -1;ch = getchar();}
while (ch >= '0' && ch <= '9'){ret = ret*10 + ch - '0';ch = getchar();}
return ret*sgn;}
inline void Out(int  a){if(a>9) Out(a/10);putchar(a%10+'0');}
int  qmul(int  a,int  b,int  mod){int  res=0;while(b){if(b&1)res=(res+a)%mod;a=(a+a)%mod;b>>=1;}return res;}
int  qpow(int  m,int  k,int  mod){int  res=1%mod,t=m%mod;while(k){if(k&1)res=qmul(res,t,mod);t=qmul(t,t,mod);k>>=1;}return res;}
int  gcd(int  a,int  b){if(b > a) swap(a,b); return b==0?a : gcd(b,a%b);}
int  lcm(int  a,int  b){return a/gcd(a,b)*b;}
int  inv(int  x,int  mod){return qpow(x,mod-2,mod)%mod;}
//const int  N = 3e3+15;
int  t = 1,cas = 1;
int  n,m;
const int  N = 1e6+7;

int  Euler(int  n) {
    int  m = (int )sqrt(n + 0.5);
    int  ans = n;
    for (int  i = 2; i <= m; ++i) {
        if (n % i == 0) {
            ans = ans / i *(i - 1);
            while (n % i == 0) n /= i;
        }
    }
    if (n > 1) ans = ans / n *(n - 1);
    return ans;
}


signed main()
{
    int  X,Y,a0;
    while(cin>>X>>Y>>a0){
        int  m = max(1ll,Y/(X-1));
        int  P = a0/gcd(a0,m);
        if(Y%a0 == 0){
            cout<<1<<endl;
            continue;
        }
        if(gcd(X,P) == 1){
            int  k = Euler(P);
            int  ans = k;
            for(int  i = 2 ; i*i <= k ; i ++){
                if(k%i == 0 && qpow(X,k/i,P) == 1){
                    ans = k/i;
                    if(qpow(X,i,P) == 1){
                        ans = i;
                        break;
                    }
                }
            }
            cout<<ans<<endl;
        }
        else
            cout<<"Impossible!"<<endl;
    }
}