![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BSGS
gjghfd
这个作者很懒,什么都没留下…
展开
-
[ BSGS ] BZOJ3239
裸题#include<bits/stdc++.h> using namespace std; map<int,int>M; int b,n,p,s,S,t,tmp,T; bool f; int main(){ while(scanf("%d%d%d",&p,&b,&n)!=EOF){ s=ceil(sqrt(p)); M.clear();t=n;原创 2017-12-22 15:32:23 · 267 阅读 · 0 评论 -
[ BSGS ] BZOJ2242
%%%g1n0st大佬#include<bits/stdc++.h> using namespace std; int y,z,p,s,k,t; int T,tmp; bool f; map<int,int>M; inline int Pow(int x,int y,int z){ int Ans=1; for(;y;y>>=1,x=1ll*x*x%z) if(y&1)Ans原创 2017-12-22 16:44:13 · 181 阅读 · 0 评论 -
[ 扩展BSGS ] BZOJ1467
模板题#include<map> #include<cmath> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int k,n,m,p; int x,z,s,cnt,d; bool f; map<int,int>M; int Gcd(int x,int y)原创 2018-01-04 15:12:33 · 253 阅读 · 0 评论