A. Chewbaсca and Number

题目：
对输入的整数的每个位置的数字进行变换
规则：min(x,9-x)
若第一位是0，则是9

import java.io.PrintWriter;import java.util.Scanner;public class A514 {    void solve(){        Scanner sc=new Scanner(System.in);        String line= sc.next();        for(int i=0 ; i<line.length();i++){            int temp= line.charAt(i)-'0';            temp = Math.min(temp, 9-temp);            if(i==0 && temp==0){                temp=9;            }            System.out.print(temp);        }    }    public static void main(String[] args){//  Scanner br = new Scanner(System.in);//  String line = br.next();//  StringBuilder res = new StringBuilder("");//  for(int i = 0;i<line.length();i++){//      int cur = line.charAt(i)-'0';//      cur = Math.min(cur, 9-cur);//      if(i == 0 && cur == 0){//          cur = 9;//      }//      res.append(cur);//  }//  System.out.println(res);    new A514().solve();    }}

题目链接：http://codeforces.com/problemset/problem/514/A