Pollard Rho大整数因子分解算法(模板)

#include<bits/stdc++.h>
using namespace std;
#define Sheryang main
#define TYPE int
const int maxn=1e5+7;
typedef long long ll;
const int mod=19260817;
void Smax(TYPE &a,TYPE b){if(a<b) a=b;}
void Smin(TYPE &a,TYPE b){if(a>b) a=b;}
///#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
///char buf[(1 << 21) + 1], *p1 = buf, *p2 = buf;
#define IO cin.tie(0),ios::sync_with_stdio(false);
#define pi acos(-1)
#define PII pair<ll,ll>
ll read(){ll c = getchar(),Nig = 1,x = 0;while((c<'0' || c>'9') && c!='-')c = getchar();if(c == '-')Nig = -1,c = getchar();while(c>='0'&&c<='9')x = ((x<<1) + (x<<3)) + (c^'0'),c = getchar();re