qtmatt的博客

class Solution { public: typedef pair<int,int>PII; int get_single_sum(int x) { int s=0; while(x)s+=x%10,x/=10;//求下标和 return s; } int get_sum(PII p) { ...

#include<iostream> #include<queue> #include<algorithm> #include<vector> using namespace std; int n; int main() { cin>>n; priority_queue<int,vector<int>,g...

#include<iostream> #include<vector> #include<queue> #include<algorithm> using namespace std; const int N=2010; int a[N],b[N],c[N]; int m,n; typedef pair<int,int> pii; ...

` #include<iostream> #include<vector> using namespace std; int n; vector<int>ans; vector<bool>rec; void dfs(int &&count) { if(ans.size()==n) { for(auto p:ans...

#include<iostream> #include<vector> using namespace std; int n,m; /*void dfs(int u,int sum,int state) { if(sum+n-u<m)return; if(sum==m) { for(int i=0;i<n;i++) ...

#include<iostream> #include<vector> using namespace std; int n; /*void dfs(int u,int state) { if(u==n) { for(int i=0;i<n;i++) if( state>>i & ...

#include<iostream> #include<cstring> using namespace std; char f[10][10]; int dx[5]={0,-1,0,1,0},dy[5]={0,0,1,0,-1};//五个位置 const int N=10000000; void turn(int x,int y)//只要按下周围五个位置状...

#include<iostream> using namespace std; int main() { long long a,b,p; cin>>a>>b>>p; long long res=0; while(b) { if(b&1)res=(res+a)%p;//提前%p把...

#include<iostream> #include<algorithm> #include<cmath> #include<vector> using namespace std; int main() { int a, b, p; cin >> a >> b >> p; i...

#include<iostream> #include<vector> #include<queue> using namespace std; typedef long long LL; typedef pair<LL,int>PLI;//权值和路径； int main() { int n,k; cin>>n>&gt...