제출 #1318924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318924		hssaan_arif	Palindromes (info1cup18_palindromes)	C++20	100 / 100	87 ms	428 KiB

palindromes

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;

#define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second

const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;

int n , A[N] , x;

void solve(){
    cin >> n;

    int ans = 0;

    for (int i=1 ; i<=n ; i++){
        cin >> x;

        string s = to_string(x) , t = s;
        reverse(s.begin() , s.end());

        if (s==t){
            ans += x;
        }

    }

    cout << ans << endl;
}

signed main(){
    // freopen("" , "r" , stdin);
    // freopen("" , "w" , stdout);
    // cout << setprecision(30);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ts = 1;
    // cin >> ts;
    while(ts--){
        solve();
    }
}

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 35 / 35