Submission #1318927

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318927		ghammazhassan	Palindromes (info1cup18_palindromes)	C++20	100 / 100	66 ms	31692 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 int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e9+7;
const int inf = 1e15;
const int LOG=17;
const int N=2e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve(){
    cin >> n;
    vector<string>a(n);
    for (int i=0;i<n;i++){
        cin >> a[i];
    }
    c=0;
    for (int i=0;i<n;i++){
        string s=a[i];
        reverse(s.begin(),s.end());
        if (s!=a[i])continue;
        x=1;
        while (s.size()){
            c+=x*(s[s.size()-1]-'0');
            s.erase(s.begin()+s.size()-1);
            x*=10;
        }
    }
    cout << c << endl;
}
signed main()    
{   
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt","r" ,stdin);
    // freopen("output.txt","w",stdout);
    // #endif
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
}

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