CodeForces - 514A Chewbaсca and Number

最新推荐文章于 2018-06-30 13:44:43 发布

axiqia

最新推荐文章于 2018-06-30 13:44:43 发布

阅读量837

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/axiqia/article/details/44710735

版权

ACM 专栏收录该内容

27 篇文章 1 订阅

订阅专栏

CodeForces - 514A

Chewbaсca and Number

Description

Luke Skywalker gave Chewbacca an integer number x. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit t means replacing it with digit 9 - t.

Help Chewbacca to transform the initial number x to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.

Input

The first line contains a single integer x(1 ≤ x ≤ 10¹⁸) — the number that Luke Skywalker gave to Chewbacca.

Output

Print the minimum possible positive number that Chewbacca can obtain after inverting some digits. The number shouldn't contain leading zeroes.

Sample Input

Input

Output

Input

Output

Source

Codeforces Round #291 (Div. 2)

The decimal representation of the final number shouldn't start with a zero.

/*  
    coder: Shawn_Xue  
    date: 2015.3.16  
    result: AC  
    description: CodeForces - 522A 
*/  
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    __int64 n;

    while(cin >> n)
    {
        int ans[120];
        int j = 0;
        for(; n != 0; n = n / 10)
        {
            int tmp = n % 10;
            if(n/10 != 0 ||(n/10 == 0 && n != 9))
                tmp = min (tmp, 9 -tmp);
            ans[j++] = tmp;
        }
        for(int i = j-1; i >= 0; i --)
        {
            cout << ans[i];
        }
        cout << endl;
    }

    return 0;
}