随笔分类 -  题解

1 2 下一页
最长公共子序列 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int f[205][205]; int main() { string sa, sb; getline(cin, sa); getline(cin, sb); int la = s 阅读全文
posted @ 2025-05-24 10:48 嵇若凌 阅读(10) 评论(0) 推荐(0)
change 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int len = s.size(), ans = 0; for (int i = 0; i < len; i++) 阅读全文
posted @ 2025-05-16 19:49 嵇若凌 阅读(10) 评论(0) 推荐(0)
统计单词 题解
摘要：题目在主页，如有出错请指出 1. include <bits/stdc++.h> using namespace std; int main() { string s; int cnt = 0; while (cin >> s && s != "*") cnt++; cout << cnt << e 阅读全文
posted @ 2025-05-16 18:54 嵇若凌 阅读(14) 评论(0) 推荐(0)
mystring 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { int maxn = INT_MIN, minn = INT_MAX; string s, ans1, ans2; while (cin >> s) { i 阅读全文
posted @ 2025-05-14 20:07 嵇若凌 阅读(8) 评论(0) 推荐(0)
将n个一位数组成最大数 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int a[15]; int main() { int n; cin >> n; for(int i = 1;i <= n;i++) cin >> a[i]; sort(a + 1, 阅读全文
posted @ 2025-05-14 20:05 嵇若凌 阅读(6) 评论(0) 推荐(0)
回文数 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; string x = s; reverse(s.begin(), s.end()); if (x == s) cou 阅读全文
posted @ 2025-05-10 11:00 嵇若凌 阅读(13) 评论(0) 推荐(0)
姓名接龙 题解
摘要：题目在主页，如有出错请指出 1. include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s, ans; for (int i = 1; i <= n; i++) { cin >> s; an 阅读全文
posted @ 2025-05-10 10:58 嵇若凌 阅读(13) 评论(0) 推荐(0)
比较大小 题解
摘要：题目在主页，如有出错请指出 1. include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int l1 = s1.size(), l2 = s2.size(), ans; if 阅读全文
posted @ 2025-05-10 10:56 嵇若凌 阅读(6) 评论(0) 推荐(0)
姓名反序输出 题解
摘要：题目在主页，如有出错请指出、 1. include <bits/stdc++.h> using namespace std; int main() { string s; getline(cin, s, '*'); reverse(s.begin(), s.end()); cout << s << 阅读全文
posted @ 2025-05-10 10:53 嵇若凌 阅读(6) 评论(0) 推荐(0)
统计字母个数 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int a[30]; int main() { string s; getline(cin, s); int len = s.size(); for (int i = 0;i < l 阅读全文
posted @ 2025-05-10 10:50 嵇若凌 阅读(6) 评论(0) 推荐(0)
统计数字字符个数 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { string s; getline(cin, s); int len = s.size(), cnt = 0; for (int i = 0;i < len 阅读全文
posted @ 2025-05-10 10:38 嵇若凌 阅读(10) 评论(0) 推荐(0)
判断奇偶数 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int len = s.size(); int n = s[len - 1] - '0'; if (n % 2 != 阅读全文
posted @ 2025-05-10 10:28 嵇若凌 阅读(11) 评论(0) 推荐(0)
中国梦 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int f[15][305]; int v[15]; int main() { int n, k; scanf("%d %d", &n, &k); for (int i = 1; i 阅读全文
posted @ 2025-05-06 16:38 嵇若凌 阅读(5) 评论(0) 推荐(0)
开心的金明 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int v[105], w[105], f[100005]; int main() { int m, n; scanf("%d %d", &m, &n); for (int i = 阅读全文
posted @ 2025-05-06 14:56 嵇若凌 阅读(10) 评论(0) 推荐(0)
幸运数字 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; bool pd(int n) { int j = 0, o = 0; bool f = 0; while (n != 0) { if (f != 0) { o += n % 10; 阅读全文
posted @ 2025-04-29 15:26 嵇若凌 阅读(13) 评论(0) 推荐(0)
背包问题 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int v[105], w[105], ans[105][1005]; int main() { int m, n; scanf("%d %d", &m, &n); for (int 阅读全文
posted @ 2025-04-29 14:07 嵇若凌 阅读(3) 评论(0) 推荐(0)
好运来 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int nextlucky(int n) { if (n < 1) return 1; vector < int > lucky; for (int i = 1; i <= 9; i 阅读全文
posted @ 2025-04-26 10:57 嵇若凌 阅读(16) 评论(0) 推荐(0)
观察 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin >> n >> x >> y; if (x < y) cout << y - x << endl; else cout < 阅读全文
posted @ 2025-04-26 10:25 嵇若凌 阅读(19) 评论(0) 推荐(0)
数形结合 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; cout << (n + 1) / 2 << endl; return 0; } 阅读全文
posted @ 2025-04-26 10:23 嵇若凌 阅读(6) 评论(0) 推荐(0)
奶牛野餐 题解
摘要：题目在主页，如有出错请指出 include <bits/stdc++.h> using namespace std; int a[105], mark[1005]; bool vis[1005]; vector < int > v[1005]; void dfs(int x) { vis[x] = 阅读全文
posted @ 2025-04-26 10:13 嵇若凌 阅读(5) 评论(0) 推荐(0)

1 2 下一页