# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80805 | farukkastamonuda | Palindromes (info1cup18_palindromes) | C++14 | 288 ms | 10236 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 <bits/stdc++.h>
#define fi first
#define se second
#define lo long long
#define inf 1000000000
#define md 1000000007
#define li 2005
#define mp make_pair
#define pb push_back
using namespace std;
int n, x, xx;
lo int sum;
vector < int > v;
int main(){
scanf("%d", &n);
for(int i = 1;i <= n; i++){
scanf("%d", &x);
xx = x;
//vector< int > v;
while(x){
v.pb(x % 10);
x /= 10;
}
int flag = 0;
int bas = 0, son = (int)v.size() - 1;
while(bas < son){
if(v[bas] != v[son]){
flag = 1;
break;
}
bas++;
son--;
}
if(flag == 0) sum += xx;
v.clear();
}
printf("%lld", sum);
return 0;
}
Compilation message (stderr)
# | 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... |