高次同余方程：poj 3243+poj 2417+hdu 2815 （Baby Step Giant Step 算法）

最新推荐文章于 2020-12-10 17:27:31 发布

Hacker_vision

最新推荐文章于 2020-12-10 17:27:31 发布

阅读量879

点赞数 1

分类专栏：数论文章标签：高次同余方程

本文链接：https://blog.csdn.net/u012717411/article/details/43056643

版权

数论专栏收录该内容

29 篇文章 0 订阅

订阅专栏

个人水平有限，套用的模板，学习资料如下：

题目链接：poj 3243 http://poj.org/problem?id=3243

poj 2417 http://poj.org/problem?id=2417

hdu 2815 http://acm.hdu.edu.cn/showproblem.php?pid=2815

参考文献（转载）：

http://hi.baidu.com/aekdycoin/item/236937318413c680c2cf29d4

参考代码：

poj 3243:

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
#include 
       
       
         #include 
        
          #include 
         
           using namespace std; typedef long long ll; const int maxn = 65535; struct hash{ int a,b,next; }Hash[maxn << 1]; int flg[maxn + 66]; int top,idx; void ins(int a,int b) { int k = b & maxn; if(flg[k] != idx){ flg[k] = idx; Hash[k].next = -1; Hash[k].a = a; Hash[k].b = b; return ; } while(Hash[k].next != -1){ if(Hash[k].b == b) return ; k = Hash[k].next; } Hash[k].next = ++ top; Hash[top].next = -1; Hash[top].a = a; Hash[top].b = b; } int find(int b) { int k = b & maxn; if(flg[k] != idx) return -1; while(k != -1){ if(Hash[k].b == b) return Hash[k].a; k = Hash[k].next; } return -1; } int gcd(int a,int b){return b?gcd(b,a%b):a;} int extended_gcd(int a,int b,int& x,int& y) { if (b==0){x=1,y=0;return a;} int d=extended_gcd(b,a%b,y,x); y-=a/b*x; return d; } int Inval(int a,int b,int n){ int x,y,e; extended_gcd(a,n,x,y); e=(ll)x*b%n; return e<0?e+n:e; } int quickpow_mod(ll a,int b,int c) { ll ret=1%c;a%=c; while(b){if(b&1)ret=ret*a%c;a=a*a%c;b>>=1;} return ret; } int BabyStep(int A,int B,int C) { top = maxn; ++ idx; ll buf=1%C,D=buf,K; int i=0,d=0,tmp; for(i=0;i<=100;buf=buf*A%C,++i)if(buf==B)return i; while((tmp=gcd(A,C))!=1){ if(B%tmp)return -1; ++d; C/=tmp; B/=tmp; D=D*A/tmp%C; } int M=(int)ceil(sqrt((double)C)); for(buf=1%C,i=0;i<=M;buf=buf*A%C,++i)ins(i,buf); for(i=0,K=quickpow_mod((ll)A,M,C);i<=M;D=D*K%C,++i){ tmp=Inval((int)D,B,C);int w ; if(tmp>=0&&(w = find(tmp)) != -1) return i*M+w+d; } return -1; } int main() { //freopen("input.txt","r",stdin); int A,B,C; while(cin>>A>>C>>B&&(A || B || C)){ B %= C; int tmp=BabyStep(A,B,C); if(tmp<0)puts("No Solution"); else cout< 
          
            <

 
 
 poj 2417:
  
  
  #include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
#include 
        
        
          #include 
         
           #include 
          
            using namespace std; typedef long long ll; const int maxn = 65535; struct hash{ int a,b,next; }Hash[maxn << 1]; int flg[maxn + 66]; int top,idx; void ins(int a,int b) { int k = b & maxn; if(flg[k] != idx){ flg[k] = idx; Hash[k].next = -1; Hash[k].a = a; Hash[k].b = b; return ; } while(Hash[k].next != -1){ if(Hash[k].b == b) return ; k = Hash[k].next; } Hash[k].next = ++ top; Hash[top].next = -1; Hash[top].a = a; Hash[top].b = b; } int find(int b) { int k = b & maxn; if(flg[k] != idx) return -1; while(k != -1){ if(Hash[k].b == b) return Hash[k].a; k = Hash[k].next; } return -1; } int gcd(int a,int b){return b?gcd(b,a%b):a;} int extended_gcd(int a,int b,int& x,int& y) { if (b==0){x=1,y=0;return a;} int d=extended_gcd(b,a%b,y,x); y-=a/b*x; return d; } int Inval(int a,int b,int n){ int x,y,e; extended_gcd(a,n,x,y); e=(ll)x*b%n; return e<0?e+n:e; } int quickpow_mod(ll a,int b,int c) { ll ret=1%c;a%=c; while(b){if(b&1)ret=ret*a%c;a=a*a%c;b>>=1;} return ret; } int BabyStep(int A,int B,int C) { top = maxn; ++ idx; ll buf=1%C,D=buf,K; int i=0,d=0,tmp; for(i=0;i<=100;buf=buf*A%C,++i)if(buf==B)return i; while((tmp=gcd(A,C))!=1){ if(B%tmp)return -1; ++d; C/=tmp; B/=tmp; D=D*A/tmp%C; } int M=(int)ceil(sqrt((double)C)); for(buf=1%C,i=0;i<=M;buf=buf*A%C,++i)ins(i,buf); for(i=0,K=quickpow_mod((ll)A,M,C);i<=M;D=D*K%C,++i){ tmp=Inval((int)D,B,C);int w ; if(tmp>=0&&(w = find(tmp)) != -1) return i*M+w+d; } return -1; } int main() { // freopen("input.txt","r",stdin); int A,B,C; while(cin>>C>>A>>B){ B %= C; int tmp=BabyStep(A,B,C); if(tmp<0)puts("no solution"); else cout< 
           
             < 
             
            
           
          
        
      
      
     
     
    
     
 
 
 
 hdu 2815:
  
   
   #include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
#include 
         
         
           #include 
          
            #include 
           
             using namespace std; typedef long long ll; const int maxn = 65535; struct hash{ int a,b,next; }Hash[maxn << 1]; int flg[maxn + 66]; int top,idx; void ins(int a,int b) { int k = b & maxn; if(flg[k] != idx){ flg[k] = idx; Hash[k].next = -1; Hash[k].a = a; Hash[k].b = b; return ; } while(Hash[k].next != -1){ if(Hash[k].b == b) return ; k = Hash[k].next; } Hash[k].next = ++ top; Hash[top].next = -1; Hash[top].a = a; Hash[top].b = b; } int find(int b) { int k = b & maxn; if(flg[k] != idx) return -1; while(k != -1){ if(Hash[k].b == b) return Hash[k].a; k = Hash[k].next; } return -1; } int gcd(int a,int b){return b?gcd(b,a%b):a;} int extended_gcd(int a,int b,int& x,int& y) { if (b==0){x=1,y=0;return a;} int d=extended_gcd(b,a%b,y,x); y-=a/b*x; return d; } int Inval(int a,int b,int n){ int x,y,e; extended_gcd(a,n,x,y); e=(ll)x*b%n; return e<0?e+n:e; } int quickpow_mod(ll a,int b,int c) { ll ret=1%c;a%=c; while(b){if(b&1)ret=ret*a%c;a=a*a%c;b>>=1;} return ret; } int BabyStep(int A,int B,int C) { top = maxn; ++ idx; ll buf=1%C,D=buf,K; int i=0,d=0,tmp; for(i=0;i<=100;buf=buf*A%C,++i)if(buf==B)return i; while((tmp=gcd(A,C))!=1){ if(B%tmp)return -1; ++d; C/=tmp; B/=tmp; D=D*A/tmp%C; } int M=(int)ceil(sqrt((double)C)); for(buf=1%C,i=0;i<=M;buf=buf*A%C,++i)ins(i,buf); for(i=0,K=quickpow_mod((ll)A,M,C);i<=M;D=D*K%C,++i){ tmp=Inval((int)D,B,C);int w ; if(tmp>=0&&(w = find(tmp)) != -1) return i*M+w+d; } return -1; } int main() { // freopen("input.txt","r",stdin); int A,B,C; while(cin>>A>>C>>B){ if(B>=C) {puts("Orz,I can't find D!");continue;} B %= C; int tmp=BabyStep(A,B,C); if(tmp<0)puts("Orz,I can't find D!"); else cout< 
            
              <

Hacker_vision

关注

1
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
高次同余方程：poj 3243+poj 2417+hdu 2815 （Baby Step Giant Step 算法）

个人水平有限，套用的模板，学习资料如下：题目链接：poj 3243 http://poj.org/problem?id=3243 poj 2417 http://poj.org/problem?id=2417 hdu 2815 http://acm.hdu.edu.cn/showproblem.php?pid=
复制链接

扫一扫