第一道题:回文数的判定 AC
#include <iostream>
#include <algorithm>
using namespace std;
long long n, x;
bool hws(long long n) {
long long ans = 0, m = n;
while (m > 0) {
ans = ans*10 + m%10;
m /= 10;
}
x = ans;
return ans == n;
}
int main() {
scanf("%d", &n);
if (hws(n)) puts("Palindromic Number");
else puts("Non-Palindromic Number");
return 0;
}
第二道题:评委打分 AC
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 7;
int n, a[N], mx = -1, mn = N;
int main() {
int sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
sum += a[i];
}
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
sum = sum-mx-mn;
printf(&#