09 2022 档案
摘要：#include<bits/stdc++.h>using namespace std;const int maxn = 1e4;int n,m;int mod =1e4;int temp[maxn][maxn];int res[maxn][maxn],a[maxn][maxn];void mul(i
阅读全文
摘要：//递归 #include<iostream>using namespace std;const int maxn = 1e5+5;typedef long long ll;ll fastpow(ll a , ll n){ if(n==1) return a; ll temp = fastpow(a
阅读全文
摘要：排列： #include<bits/stdc++.h>using namespace std;const int maxn = 1e3 +5;#define swap(a,b){int temp = a ; a = b ; b = temp;}int data[maxn];void so(){ fo
阅读全文
