ABC445我的代码+C求调
2026-02-15 17:49:15
发布于：江西
8阅读
0回复
0点赞
A
AC
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[s.size() - 1]) cout << "Yes";
else cout << "No";
return 0;
}
B
AC
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxn = 0;
string s[105];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i].size() > maxn)
maxn = s[i].size();
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < (maxn - s[i].size()) / 2; j++){
cout << '.';
}
for (int j = 0; j < s[i].size(); j++)
cout << s[i][j];
for (int j = 0; j < (maxn - s[i].size()) / 2; j++){
cout << '.';
}
cout << endl;
}
return 0;
}
C
17AC+1TLE
#include <bits/stdc++.h>
using namespace std;
int dp[500005]; // 存走过的路
int main() {
int n, a[500005];
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int s = 1; s <= n; s++) {
if (dp[s] != 0) {
cout << dp[s] << " "; // // 以前走过这条路，提前结束
} else {
int idx = s;
for (int i = 1; i <= n; i++) { // 在移动n次以内必定会进入一个环
idx = a[idx]; // 移动棋子
if (idx == a[idx]) break; // 判断是否已进入环
}
dp[s] = idx; // 记住这条路
cout << idx << " ";
}
}
return 0;
}
有帮助，赞一个