제출 #1318925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318925		muhammad-mutahir	Palindromes (info1cup18_palindromes)	C++20	100 / 100	147 ms	444 KiB

palindromes

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;
int ans  =0;
void solve(int testcase_number){
    cin>>n;
    int on = n;
    vector<int>rp;
    while(n>0){
    	rp.pb(n%10);
    	n/=10;
    }
    // rp.pb(n);
    int f = 1;
    int l =0;
    int r = rp.size()-1;
    // print(rp);
    while(l<=r){
    	if(rp[l] != rp[r]){
    		f = 0;
    		break;
    	}
    	l++;
    	r--;
    }
    // cout<<f*on<<endl;
    ans+=f*on;




}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }
    cout<<ans<<endl;

}

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