| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1318928 | hynmj | Palindromes (info1cup18_palindromes) | C++20 | 81 ms | 444 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const long long N = 2e5 + 5;
int a[N];
void solve()
{
int n;
cin >> n;
string s;
int k;
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> k;
s = to_string(k);
bool ok = 1;
for (int i = 0, j = s.size() - 1; i < j; i++, j--)
{
if (s[i] != s[j])
{
ok = 0;
break;
}
}
if (ok)
sum += k;
}
cout << sum << endl;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;/
for (int i = 1; i <= t; i++)
{
// cout << "Case #" << i << ':' << ' ';
solve();
// cout << endl;
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
