Chri_K

摘要： //快速幂 #include<iostream>#include<cstdio>using namespace std;int n,m,x;long long k;int ans=1;int fstpow(int a,long long b){ while(b>0) { if(b%2==1) { a 阅读全文

摘要： #include<iostream>using namespace std;int n,a1,b1,xa,xb;int a[210],b[210];int mac[5][5]={{0,0,1,1,0},{1,0,0,1,0},{0,1,0,0,1},{0,0,1,0,1},{1,1,0,0,0}}; 阅读全文

摘要： //同余方程 #include<iostream>#include<cstdio>using namespace std;int main(){ long long a,b,x; cin>>a>>b; x=a*b-a-b; cout<<x<<endl; return 0;} 阅读全文