摘要:
Hello KikiTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2734Accepted Submission(s): 1010Problem ... 阅读全文
摘要:
套模板,因为要是正整数,所以处理一下x=0的情况。X问题Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4444Accepted Submissio... 阅读全文
摘要:
void extendgcd(long long a,long long b,long long &d,long long &x,long long &y){ if(b==0){d=a;x=1;y=0;return;} extendgcd(b,a%b,d,y,x); y -= x*... 阅读全文
摘要:
#include #include #include #include #include using namespace std;#define N 10100/*对于x=r0(mod m0) x=r1(mod m1) ... x=rn(mod mn)输入数组m和数组r... 阅读全文
摘要:
一个exgcd解决一个线性同余问题,多个exgcd解决线性同余方程组。Strange Way to Express IntegersTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 12001Accepted: 3797Descrip... 阅读全文