# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
220301 | 2020-04-07T15:24:24 Z | Sho10 | Palindromes (info1cup18_palindromes) | C++14 | 185 ms | 10120 KB |
/* ID: Sho10 LANG: C++ */ #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10 #define ll long long int #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define all(a) (a).begin(), (a).end() #define sz size #define f first #define s second #define pb push_back #define er erase #define in insert #define mp make_pair #define pi pair #define rc(s) return cout<<s,0 #define endl '\n' #define mod 1000000007 #define PI 3.14159265359 #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; ll n,x,sum=0; vector<ll>v; ll check(ll x){ v.clear(); while(x){ v.pb(x%10); x=x/10; } for(ll i=0;i<v.size();i++) { if(v[i]!=v[v.size()-1-i]){ return 0; } } return 1; } int32_t main(){ CODE_START; cin>>n; for(ll i=0;i<n;i++) { cin>>x; ll val=x; if(check(x)){ sum=sum+val; } } cout<<sum<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 7 ms | 384 KB | Output is correct |
3 | Correct | 91 ms | 5112 KB | Output is correct |
4 | Correct | 146 ms | 7800 KB | Output is correct |
5 | Correct | 180 ms | 10120 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 42 ms | 1784 KB | Output is correct |
4 | Correct | 74 ms | 3192 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 42 ms | 1784 KB | Output is correct |
4 | Correct | 74 ms | 3192 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 6 ms | 384 KB | Output is correct |
7 | Correct | 69 ms | 3320 KB | Output is correct |
8 | Correct | 96 ms | 4088 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 7 ms | 384 KB | Output is correct |
3 | Correct | 91 ms | 5112 KB | Output is correct |
4 | Correct | 146 ms | 7800 KB | Output is correct |
5 | Correct | 180 ms | 10120 KB | Output is correct |
6 | Correct | 5 ms | 384 KB | Output is correct |
7 | Correct | 5 ms | 384 KB | Output is correct |
8 | Correct | 42 ms | 1784 KB | Output is correct |
9 | Correct | 74 ms | 3192 KB | Output is correct |
10 | Correct | 5 ms | 384 KB | Output is correct |
11 | Correct | 6 ms | 384 KB | Output is correct |
12 | Correct | 69 ms | 3320 KB | Output is correct |
13 | Correct | 96 ms | 4088 KB | Output is correct |
14 | Correct | 5 ms | 384 KB | Output is correct |
15 | Correct | 11 ms | 640 KB | Output is correct |
16 | Correct | 75 ms | 4216 KB | Output is correct |
17 | Correct | 173 ms | 9340 KB | Output is correct |
18 | Correct | 181 ms | 9976 KB | Output is correct |
19 | Correct | 182 ms | 9976 KB | Output is correct |
20 | Correct | 185 ms | 10104 KB | Output is correct |