結果

問題 No.539 インクリメント
ユーザー 37zigen
提出日時 2020-03-26 00:40:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 528 ms / 2,000 ms
コード長 3,495 bytes
コンパイル時間 2,641 ms
コンパイル使用メモリ 83,024 KB
実行使用メモリ 63,564 KB
最終ジャッジ日時 2025-01-02 00:28:25
合計ジャッジ時間 4,814 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
long t = System.currentTimeMillis();
new Main().run();
System.err.println(System.currentTimeMillis() - t);
}
void run() {
Scanner sc = new Scanner(System.in);
int T=Integer.valueOf(sc.nextLine());
for(int t=0;t<T;++t) {
String s=sc.nextLine();
int p=s.length();
while(p>0&&!(0<=(int)(s.charAt(p-1)-'0')&&9>=(int)(s.charAt(p-1)-'0')))--p;
int last=p;
while(p>0&&0<=(int)(s.charAt(p-1)-'0')&&9>=(int)(s.charAt(p-1)-'0')) {
--p;
}
if(last!=0) {
String tail_str=String.valueOf(f(s.substring(p,last).toCharArray()));
StringBuilder zero=new StringBuilder();
while(zero.length()+tail_str.length()<last-p) {
zero=zero.append("0");
}
System.out.println(s.substring(0, p)+zero+tail_str+s.substring(last, s.length()));
}else {
System.out.println(s);
}
}
}
char[] f(char[] a) {
char[] ret=new char[a.length+1];
int carry=1;
for(int i=0;i<ret.length;++i) {
int v=(i>a.length-1?0:(int)(a[a.length-1-i]-'0'))+carry;
ret[ret.length-1-i]=(char)(v%10+'0');
carry=v/10;
}
if(ret[0]=='0')ret=Arrays.copyOfRange(ret, 1, ret.length);
return ret;
}
static void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
return (int)nextLong();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0