真新镇小智要成为宝可梦大师

分类

题解(2)

/ 注册

全部文章（共39篇）

题解 | 学生查询

#include <iostream> #include <map> #include <vector> using namespace std; struct student { int no; string name; string s...

2025-04-07

0 19

题解 | 点的距离

#include <bits/stdc++.h> using namespace std; class CPoint{ public: int x,y; CPoint(int x,int y){ this->x=x; this->...

2025-04-07

0 18

题解 | 日期累加

#include <iostream> using namespace std; int days[] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 }; int main() { int year, month, day, n, cnt; ...

2025-04-07

0 22

题解 | 单词识别

#include <iostream> #include <map> using namespace std; void f(char &c){ if(c>='A'&&c<='Z') c+=32; } bool is...

2025-04-07

0 16

题解 | 剩下的树

#include <bits/stdc++.h> using namespace std; int main() { int n,m; int a,b; while(cin>>n>>m){ vector<bool&g...

2025-03-28

0 23

题解 | 最长&最短文本

#include <iostream> #include <vector> using namespace std; int main() { vector<string>Long, Short; Long.push_back("&qu...

2025-03-24

0 16

题解 | 字符串连接

#include <iostream> using namespace std; int main() { string a, b; while (cin >> a >> b) { // 注意 while 处理多个 case co...

2025-03-24

0 16

题解 | 二叉排序树

#include <iostream> using namespace std; struct Node { int val; Node* l, *r; }; void insert(Node* root, int x) { if (x > root->...

2025-03-24

0 16

题解 | IP地址

#include <iostream> using namespace std; int main() { int arr[4]; while (~scanf("%d.%d.%d.%d",arr,arr+1,arr+2,arr+3)) { // 注意...

2025-03-24

0 22

题解 | 查找

#include <iostream> #include <set> using namespace std; int main() { int n; while (cin >> n) { // 注意 while 处理多个 case ...

2025-03-24

0 19