Codeforces Round #291 (Div. 2)

最新推荐文章于 2024-09-21 12:17:42 发布

bupt_xycr

最新推荐文章于 2024-09-21 12:17:42 发布

阅读量261

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/u013077144/article/details/51212041

版权

Codeforces 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

http://codeforces.com/contest/514/problem/A

A. Chewbaсca and Number

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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?≤?1018) — 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 test(s) 
        
            input 
          
27

            output 
          
22

            input 
          
4545

            output 
          
4444

题目大意是用对于x的每一位数t你可以选择替换成9-t或则不换。且保证不会替换出前导0

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#include <stack>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b)
{
    return a>b;
}
char s[20];
int main()
{
    #ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    cin>>s;
    int l=strlen(s);
    int num=0;
    for(int i=0;i<l;i++)
	{
		if(i==0&&s[i]=='9')continue;
		int t=s[i]-'0';
		t=min(t,9-t);
		s[i]=(char)t+'0';
	}
	cout<<s<<endl;
    return 0;
}
//一开始拒绝这么写的。。直到wrong 了5次