JianJ

分类

/ 注册

全部文章（共53篇）

题解 | #放苹果#

#include<iostream> using namespace std; int m,n; int dfs(int u,int sum,int last) { if(u == n){ if(sum == 0) return 1; else return 0; } ...

2024-03-09

0 181

题解 | #最大序列和#

#include<iostream> #include<string.h> using namespace std; const int N = 1e6 + 10; int arr[N]; int f[N]; int main(void) { int n; while...

2024-03-08

0 149

题解 | #求最大最小数#

#include<iostream> using namespace std; int main(void) { int n; while(cin >> n) { int MAX_Val = -0x3f3f3f3f; int MIN_Val = 0x3f3f3...

2024-03-08

0 154

题解 | #最小邮票数#

#include<iostream> #include<string.h> using namespace std; const int N = 1100; int v[N]; int f[N][N]; int main(void) { int m,n; memset...

2024-03-08

0 154

题解 | #二叉树遍历#

#include <iostream> using namespace std; struct TreeNode { char val; TreeNode* left; TreeNode* right; }; int i = 0; void create(st...

2024-03-08

0 160

题解 | #二叉树遍历#

#include<iostream> using namespace std; struct TreeNode{ char ch; TreeNode* left; TreeNode* right; }; int i = 0; void create(string...

2024-03-08

0 144

题解 | #查找学生信息#

#include<iostream> using namespace std; const int N = 1100; struct Student{ string id; string name; string gender; int age; }s[N]; int ma...

2024-03-08

0 217

题解 | #反序输出#

#include<iostream> #include<algorithm> using namespace std; int main(void) { string s; while(cin >> s) { reverse(s.begin(),s.e...

2024-03-08

0 168

题解 | #整数拆分#

#include<iostream> using namespace std; const int MOD = 1e9; const int N = 1000010; int f[N]; int v[30]; int main(void) { int n; cin >&g...

2024-03-07

0 179

题解 | #进制转换#

#include<iostream> using namespace std; #include<vector> #include<algorithm> //高精度除法 vector<int> div(vector<int>&...

2024-03-06

0 173