总之就是非常浪漫

分类

/ 注册

全部文章（共56篇）

朴素思想

#include <iostream> #include <cstring> using namespace std; const int N=1024; const int M=1024; int main() { int books[M],readers[...

2023-02-22

0 226

题解 | #统计同成绩学生人数#

#include <cstdio> #include <cstring> using namespace std; int hashtable[101]; int main() { int n,target; while (scanf("%d",&n)!=E...

2023-02-22

0 224

题解 | #子串计算#

#include <iostream> #include <map> #include <string> using namespace std; int main() { ios::sync_with_stdio(false); strin...

2023-02-22

0 217

题解 | #魔咒词典#

#include <unordered_map> #include <string> #include <iostream> using namespace std; const string ENDFLAG="@END@"; const string DEF...

2023-02-22

0 274

题解 | #查找学生信息# #写复杂了，淦#

#include <iostream> #include <unordered_map> #include <string> using namespace std; struct Student { string name; string se...

2023-02-21

0 298

题解 | #查找第K小数#

#include <iostream> #include <algorithm> using namespace std; const int NNUM=1000; bool hashTable[NNUM+1]; int main() { int nums[NNUM...

2023-02-21

0 232

题解 | #哈夫曼树#

#include <iostream> #include <queue> using namespace std; int main() { ios::sync_with_stdio(false); int n,temp,ans; priority...

2023-02-21

0 255

题解 | #二叉排序树#

#include <cstdio> using namespace std; //const int NNUM=1e8 struct TN { int data; TN* left,*right; TN(int c):data(c),left(NULL),rig...

2023-02-20

1 351

题解 | #二叉树遍历#

#include <string> #include <iostream> using namespace std; struct TreeNode { char data; TreeNode *left; TreeNode *right; ...

2023-02-20

1 345

题解 | #首字母大写#

#include <iostream> #include <string> using namespace std; int main() { //ios::sync_with_stdio(false); string str; while(get...

2023-02-18

0 248