luoxutimberjack的博客

运用了dp思想，费马定理，快速幂

方法一：打表 #include<bits/stdc++.h> using namespace std; const int maxn=2e5+10; int mis[maxn]; int main() { int zi[200]; int z1[27][maxn]; int t,x,y; char a[maxn]; scanf("%d",&...

一道关于快速幂的题目，没做过几道这种题目，本人原来没能做出来，现在写出来自己现在看这道题的一些体会 G - Maximum Palindromes Madam Hannah Otto, the CEO of Reviver Corp., is fond of palindromes, or words that read the same forwards or backwards. She th...

#include #include <bits/stdc++.h> using namespace std; const int maxn=10000100; const int maxm=10000100; int mark[maxm]; int Prime[maxm]; bool judge(int t) { if(t<=1) return false; for(int i...