qq_43528228的博客

给定三个整数a(a>=0),n(n>=0),p(p>0)。 求解 ans=(a0+a1+a2+a3+…+a^n)mod p1≤T≤1e50≤a≤1e90≤n≤1e180<p≤2e9#include<iostream>#include<cstdio>using namespace std;long long Pow(int x, long long y, int p) { if(y == 0) return 1%p; else if(y

#include<iostream>#include<cstdlib>#include<ctime>using namespace std;void swap(int *a, int *b){ int t = *a; *a = *b; *b = t; } int partition(int *a, int p, int q){ int pivot = a[p]; int i = p; for(int j = p+1;j <= q;j++)

#include<iostream>#include<cstdlib>#include<ctime>#include<algorithm>using namespace std;const int MAXN = 5;const int inf = 1e9;void swap(int *x, int *y){ int t = *x; *x = *y; *y = t;}int partition(int *a, int p, int q)