saplingyang的博客

扩展欧几里得：已知a, b，求解一组x，y，使它们满足贝祖等式： ax+by =gcd(a, b) ax1+by1=gcd(a,b) bx2+(a%b)y2=gcd(b,a%b) gcd(a,b)=gcd(b,a%b) ax1+by1 = bx2+(a%b)y2 ax1+by1=bx2+(a-a/b*b)y2 ax1+by1=ay2+b(x2-a/b*y2) x1=y2; y1=x2...

求某个数的欧拉函数值 #include<iostream> #include<cmath> #define ll long long int main() { ll n; std::cin>>n; ll res=n; for(ll i=2;i<=sqrt(n);i++) { if(n%i==0) res=res/i*(i-1...

function getResult(str){ // var _str=str.repalce('*','×'); // var __str=_str.replace('/','÷'); var str1=str.split(''); var str2=[]; for(var i=0;i<str1.length;i++) { if(!Number(str1[i])&am...

#include <stdio.h> #include <string.h> #include <algorithm> #include <iostream> #include <math.h> using namespace std; const int MAXN = 100010; const double INF = 1e20; ...

int p[maxn]; void init() { for(int i=0;i<maxn;i++) p[i]=i; } int findset(int x) { return p[x]!=x?p[x]=findset(p[x]):x; } void join(int x,int y) { int a=findset(x); int b=findset(y); if(a!=b...

#include<iostream> #include<string> using namespace std; void Preorder(string inorder,string postorder) { if(inorder.size()>0) { char ch=postorder[postorder.size()-1]; cout<&l...

#include<iostream> #include<vector> #include<queue> #include<cstring> #define inf 0x3f3f3f3f #define maxn 20005 using namespace std; int d[maxn],inq[maxn]; vector<pair<in...

#include<iostream> #include<cstring> #include<vector> #include<queue> #define maxn 1005 #define inf 0x3f3f3f3f using namespace std; struct Edge{ int from,to,cap,flow,cost; Ed...

(1)邻接矩阵写法#include<stdio.h> #include<string.h> #define inf 0x3f3f3f3f int g[2500][2500]; int d[2500]; int v[2500]; int n,m,s,t; int dijkstra(int s,int t) { memset(v,0,sizeof(v)); fo...

#include<iostream> #include<vector> #include<queue> #include<cstring> #define inf 0x3f3f3f3f #define MAXN 100 using namespace std; struct Edge{ int from,to; int cap; int flo...

#include<stdio.h> int QKpass(int a[],int low,int high) { int x=a[low]; while(low<high) { while(a[high]>x&&low<high) high--; if(low<high) { a[low]=a[high]; lo...

#include<iostream> #include<cmath> #include<cstring> using namespace std; int a[50005]; long long dp[50005]; int main() { memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); int n; s...

两篇讲的比较好的博客，结合起来看 http://www.cnblogs.com/tangzhengyue/p/4315393.html http://www.cnblogs.com/yjiyjige/p/3263858.html #include #include int next[20]; char textstr[20],keystr[20]; void getnext() {

#include<iostream> #define ll long long ll exgcd(ll a,ll b,ll &x,ll &y){ if(b==0){ x=1; y=0; return a; } ll gcd=exgcd(b,a%b,y,x); y-=(a/b)*x; return gcd; } ll inv(ll a,ll p){...