LightOj 1225 Palindromic Numbers (II) Solution




 Problem Link : https://lightoj.com/problem/palindromic-numbers-ii

Solution in C++:
///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int i,t;
    cin>>t;
    for(i=1; i<=t; i++)
    {
        string s,r;
        cin>>s;
        r=s;
        reverse(r.begin(),r.end());
        if(s==r)
        cout << "Case " << i << ": "<<"Yes"<<endl;
        else
        cout << "Case " << i << ": "<<"No"<<endl;
    }
    return 0;
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.