Codeforces Round #291 (Div. 2) 514A. Chewbaсca and Number Solution


 

Problem Link:  https://codeforces.com/problemset/problem/514/A

Solve in C++:  

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a,s;
    int sz,i;
    a[0]=9;
    cin>>s;
    sz=s.size();
    for(i=0; i<sz; i++)
    {
        if(i==0&&s[i]-'0'==9)
            cout<<s[i];
       else if(s[i]-'0'>4)
            cout<<(a[0]-(s[i]-'0'));
        else
            cout<<s[i];
    }
}







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.