建一个帖来保存代码
2026-06-13 11:21:59
发布于：江苏
88阅读
0回复
0点赞
高精加
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
int a[N],b[N],c[N],d;
int main(){
string s,t;cin >> s >> t;
for(int i = 0;i < s.size();i++) a[s.size()-i] = s[i] - '0';
for(int i = 0;i < t.size();i++) b[t.size()-i] = t[i] - '0';
for(int i = 1;i <= max(s.size(),t.size()) + 1;i++){
c[i] = a[i] + b[i] + d;
d = c[i] / 10;
c[i] %= 10;
}
int id = max(s.size(),t.size()) + 1;
while(id > 1 && c[id] == 0) id--;
for(int i = id; i >= 1;i--) cout << c[i];
return 0;
}
高精减
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
string s1,s2;
int a[N],b[N],c[N];
int main(){
cin >> s1 >> s2;
int len1 = s1.size(),len2 = s2.size();
if (len1 == len2 && s1 < s2 || len1 < len2){
swap(s1,s2);
swap(len1,len2);
cout << '-';
}
for(int i = 0;i < len1;i++) a[i] = s1[len1-i-1] - '0';
for(int i = 0;i < len2;i++) b[i] = s2[len2-i-1] - '0';
for (int i = 0;i < len1;i++){
c[i] += a[i] - b[i];
if (c[i] < 0){
c[i] += 10;
c[i+1] -= 1;
}
}
int x = len1-1;
while (c[x]==0 && x > 0) x--;
for (int i = x;i >= 0;i--) cout << c[i];
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;cin >> T;
while (T--){
string s,t;cin >> s >> t;
int n = s.length();
int m = t.length();
int ml = 0;
for (int i = 0;i < n;i++){
for (int j = i;j < n;j++){
string sub = s.substr(i,j-i+1);
if (t.find(sub) != string::npos) ml = max(ml,(int)sub.length());
}
}
int ans = n + m - 2 * ml;
cout << ans << endl;
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int hex(char c){
if (c >= '0' && c <= '9') return c - '0';
else return c - 'A' + 10;
}
int main(){
int n;cin >> n;
vector<string> g(n);
for (int i = 0;i < n;i++) cin >> g[i];
int mrr = 0;
for (int i = 0;i < n;i++){
int rs = 0;
for (int j = 0;j < n;j++) rs += hex(g[i][j]);
mrr = max(mrr,rs);
}
int mcc = 0;
for (int j = 0;j < n;j++){
int cs = 0;
for (int i = 0;i < n;i++) cs += hex(g[i][j]);
mcc = max(mcc,cs);
}
cout << mrr << endl << mcc;
return 0;
}
全部评论 3
#include <bits/stdc++.h> using namespace std; int main() { int n,a[1000006];cin >> n; for (int i = 0;i < n;i++) cin >> a[i]; sort(a,a+n); int day = 1; for (int num : a){ if (num >= day) day++; } cout << (day - 1) %10; return 0; }昨天 来自 江苏
0// cccccccccccccc sssssssssssss gggggggggggggg oooooooooo !!!!!! // ccccccccccccccc ssssssssssssss ggggggggggggggg oooooooooooooo !!!!!! //cccc ssss gggg ooooo ooooo !!!!!! //ccc ssss gggg oooo oooo !!!!!! //ccc ssssssssssss gggg ggggggg oooo oooo !!!!!! //ccc ssssssssssss gggg ggggggggg oooo oooo !!!!!! //ccc ssss gggg g gg gg oooo oooo !!!! //cccc ssss gggg gg gg ooooo ooooo // ccccccccccccccc ssssssssssssss ggggggggggg gg oooooooooooooo !!!! // cccccccccccccc sssssssssssss gggggggggg gg oooooooooo !!!!2026-01-03 来自 江苏
0
有帮助，赞一个