| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 45118 | model_code | Palindromes (info1cup18_palindromes) | C++17 | 563 ms | 636 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output1", "w", stdout);
int n;cin >> n;
assert (1 <= n && n <= 1000000);
long long sum = 0LL;
for (int i = 1; i <= n; ++i)
{
int x;cin >> x;
assert (1 <= x && x <= 1000000000);
int cx = x, nr = 0;
while (cx > 0)
{
nr = nr * 10 + cx % 10;
cx /= 10;
}
if (x == nr) sum += 1LL * x;
}
cout << sum << '\n';
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... | ||||
