Vermouth贝尔摩德

分类

/ 注册

全部文章（共41篇）

题解 | 分数线划定

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

2026-01-11

0 5

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

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

2026-01-11

0 4

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

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

2026-01-09

0 8

题解 | 句子逆序

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

2026-01-09

0 7

题解 | 字符串分隔

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

2026-01-09

0 8

题解 | 宝石手串

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

2026-01-09

1 9

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

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

2026-01-08

0 13

题解 | 小红的双生排列

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

2026-01-08

0 9

题解 | 质数因子

#include <iostream> #include <vector> using namespace std; bool isprime(int k) { //judge number is prime or not for (int i = 2; i * ...

2026-01-07

0 11

题解 | 排序

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

2026-01-07

0 10