結果

問題 No.668 6.0*10^23
ユーザー uwiuwi
提出日時 2018-03-23 22:25:48
言語 Java21
(openjdk 21)
結果
AC  
実行時間 121 ms / 2,000 ms
コード長 3,303 bytes
コンパイル時間 5,901 ms
コンパイル使用メモリ 80,600 KB
実行使用メモリ 40,828 KB
最終ジャッジ日時 2024-06-30 05:03:12
合計ジャッジ時間 9,464 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,412 KB
testcase_01 AC 108 ms
40,392 KB
testcase_02 AC 106 ms
40,720 KB
testcase_03 AC 107 ms
39,972 KB
testcase_04 AC 108 ms
40,248 KB
testcase_05 AC 106 ms
40,036 KB
testcase_06 AC 107 ms
39,988 KB
testcase_07 AC 89 ms
39,808 KB
testcase_08 AC 85 ms
38,092 KB
testcase_09 AC 72 ms
37,728 KB
testcase_10 AC 85 ms
38,624 KB
testcase_11 AC 109 ms
40,260 KB
testcase_12 AC 111 ms
40,208 KB
testcase_13 AC 88 ms
38,672 KB
testcase_14 AC 116 ms
40,608 KB
testcase_15 AC 77 ms
37,840 KB
testcase_16 AC 85 ms
37,828 KB
testcase_17 AC 121 ms
40,812 KB
testcase_18 AC 84 ms
38,412 KB
testcase_19 AC 71 ms
37,572 KB
testcase_20 AC 105 ms
40,252 KB
testcase_21 AC 103 ms
40,388 KB
testcase_22 AC 107 ms
40,484 KB
testcase_23 AC 104 ms
40,480 KB
testcase_24 AC 96 ms
40,116 KB
testcase_25 AC 110 ms
40,828 KB
testcase_26 AC 86 ms
40,208 KB
testcase_27 AC 107 ms
40,356 KB
testcase_28 AC 110 ms
40,648 KB
testcase_29 AC 102 ms
40,580 KB
testcase_30 AC 106 ms
40,268 KB
testcase_31 AC 108 ms
40,208 KB
testcase_32 AC 85 ms
40,020 KB
testcase_33 AC 109 ms
40,584 KB
testcase_34 AC 102 ms
40,016 KB
testcase_35 AC 99 ms
40,240 KB
testcase_36 AC 103 ms
40,272 KB
testcase_37 AC 103 ms
40,652 KB
testcase_38 AC 103 ms
40,144 KB
testcase_39 AC 104 ms
40,500 KB
testcase_40 AC 109 ms
40,440 KB
testcase_41 AC 105 ms
40,240 KB
testcase_42 AC 102 ms
40,504 KB
testcase_43 AC 104 ms
40,644 KB
testcase_44 AC 88 ms
38,840 KB
testcase_45 AC 73 ms
37,964 KB
testcase_46 AC 78 ms
39,824 KB
testcase_47 AC 77 ms
39,760 KB
testcase_48 AC 74 ms
38,368 KB
testcase_49 AC 54 ms
37,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180323;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String s = ns();
		int c1 = s.charAt(1)-'0';
		int c0 = s.charAt(0)-'0';
		if(s.charAt(2) >= '5'){
			c1++;
			if(c1 >= 10){
				c0++;
				c1 -= 10;
			}
		}
		if(c0 == 10){
			out.println("1.0*10^" + (s.length()));
		}else{
			out.println(c0 + "." + c1 + "*10^" + (s.length()-1));
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0