DT_Zhangshuo的博客

Coprime Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 44    Accepted Submission(s): 34 Problem Description Do you know wha

Easy Summation Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 54    Accepted Submission(s): 32 Problem Description You are encounter

a和b的线性组合表示的是ax+by，扩展欧几里得是求ax+by=gcd(a,b)中x和y的值，假设gcd(a,b)==c根据欧几里得公式则gcd(b,a%b)=c，设他们的线性组个是bX+(a%b)Y, bX+(a%b)Y =bX+(a-(a/b)b)Y =bX+aY-(a/b)bY =aY+b(X-(a/b)Y) 所以得出递推公式，x=Y，y=(X-(a/b)Y). #include

素数筛选法

公约数

扩展欧几里得，逆推 #include #include #include #define Mod 9973 using namespace std; int n,b,d; int x,y; void ex_gcd(int a, int b, int &x, int &y) { if(!b) { x = 1; y = 0;

计算星期