Vermouth贝尔摩德

分类

/ 注册

全部文章（共43篇）

题解 | 支付宝消费打折

#include <algorithm> #include <iostream> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false);//缩短运行...

2026-01-11

0 21

题解 | 小苯送礼物

#include <algorithm> #include <iostream> #include <vector> using namespace std; struct fan { int id; int like; int book...

2026-01-11

0 22

题解 | 分数线划定

#include <algorithm> #include <cmath> #include <iostream> #include <vector> using namespace std; int main() { int n, m; ...

2026-01-11

0 29

题解 | 在字符串中找出连续最长的数字串

#include <cctype> #include <iostream> #include <vector> using namespace std; int main() { string s; while (cin >> s) ...

2026-01-11

0 25

题解 | 删除字符串中出现次数最少的字符

#include <climits> #include <iostream> #include <vector> using namespace std; string get_target_str( string str) { vector<in...

2026-01-09

0 32

题解 | 句子逆序

#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; int main() { vector<...

2026-01-09

0 24

题解 | 字符串分隔

#include <iostream> using namespace std; int main() { string s; int total; cin >> s; if (s.size() % 8 == 0) total...

2026-01-09

0 24

题解 | 宝石手串

#include <climits> #include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vecto...

2026-01-09

1 23

题解 | 计算某字符出现次数

#include <iostream> using namespace std; int main() { string s; getline(cin, s); int cnt = 0; char c = tolower(getchar()); ...

2026-01-08

0 23

题解 | 小红的双生排列

#include <iostream> using namespace std; long long m = 1e9 + 7; // 递归计算阶乘并取模,取模is must, 否则容易计算出错为0 long long factorial(int n) { if ((n == ...

2026-01-08

0 27