在考古的小鱼干很有气魄

分类

/ 注册

全部文章（共81篇）

题解 | #矩阵幂#

#include <bits/stdc++.h> #define MAX 100 using namespace std; typedef long long ll; typedef struct matrix{ ll data[MAX][MAX]; matrix(){ me...

2023-03-17

1 302

题解 | #查找第K小数#

#include <bits/stdc++.h> using namespace std; int main(){ set<int> st; int n,tmp; cin>>n; for(int i = 0; i < n; i++) { ci...

2023-03-16

1 348

题解 | #哈夫曼树#

#include <bits/stdc++.h> using namespace std; int main(){ int n,tmp; vector<int> v; cin>>n; for(int i = 0; i < n; i++){ ...

2023-03-16

1 287

题解 | #二进制数#

#include <bits/stdc++.h> #define MAX 50 using namespace std; void d2b(unsigned int n){ int data[MAX],len = 0; while(n){ data[len++] = n ...

2023-03-16

1 270

题解 | #字符串的排列#

class Solution { public: vector<string> res; void dfs(vector<char> data, bool visited[], string list) { if (list.size() ...

2023-03-16

1 279

题解 | #有重复项数字的全排列#

class Solution { public: vector<vector<int>> res; void dfs(vector<int> &num,vector<int> list,int visited[]){ ...

2023-03-16

1 290

题解 | #没有重复项数字的全排列#

class Solution { public: vector<vector<int>> res; void fun(vector<int> &num,vector<int> list){ if(list.size()...

2023-03-16

1 271

题解 | #旋转矩阵#

#include <bits/stdc++.h> #define MAX 10 using namespace std; //上下翻转 void Topfilp(int (&data)[MAX][MAX],int size){ for(int i = 0; i < size ...

2023-03-16

2 426

题解 | #C翻转#

#include <bits/stdc++.h> #define MAX 50 using namespace std; //上下反转 void Topfilp(int (&data)[6][6],int x,int y,int size){ for(int i = 0; i &l...

2023-03-15

1 347

题解 | #素数#

#include <bits/stdc++.h> using namespace std; bool issu(int x){ for(int j = 2; j < x; j++){ if(x % j == 0) return false; } retur...

2023-03-15

2 318