# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45496 | IvanC | Palindromes (info1cup18_palindromes) | C++17 | 984 ms | 564 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>
using namespace std;
typedef long long ll;
int main(){
ll soma = 0;
int N;
scanf("%d",&N);
for(int vez = 1;vez<=N;vez++){
int x,copia;
vector<int> V,U;
scanf("%d",&x);
copia = x;
while(x != 0){
V.push_back(x % 10);
U.push_back(x % 10);
x /= 10;
}
reverse(U.begin(),U.end());
if(V == U) soma += copia;
}
printf("%lld\n",soma);
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... |