結果

問題 No.668 6.0*10^23
ユーザー ziitaziita
提出日時 2018-03-23 22:38:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 119 ms / 2,000 ms
コード長 3,790 bytes
コンパイル時間 2,302 ms
コンパイル使用メモリ 86,696 KB
実行使用メモリ 40,992 KB
最終ジャッジ日時 2024-06-30 05:11:09
合計ジャッジ時間 8,827 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
37,916 KB
testcase_01 AC 109 ms
40,656 KB
testcase_02 AC 115 ms
40,868 KB
testcase_03 AC 113 ms
40,520 KB
testcase_04 AC 118 ms
40,312 KB
testcase_05 AC 89 ms
40,356 KB
testcase_06 AC 109 ms
40,604 KB
testcase_07 AC 78 ms
39,680 KB
testcase_08 AC 73 ms
38,244 KB
testcase_09 AC 83 ms
38,672 KB
testcase_10 AC 107 ms
40,072 KB
testcase_11 AC 107 ms
40,580 KB
testcase_12 AC 108 ms
40,016 KB
testcase_13 AC 110 ms
40,400 KB
testcase_14 AC 110 ms
40,736 KB
testcase_15 AC 90 ms
38,432 KB
testcase_16 AC 89 ms
40,052 KB
testcase_17 AC 119 ms
40,644 KB
testcase_18 AC 113 ms
40,260 KB
testcase_19 AC 96 ms
39,972 KB
testcase_20 AC 111 ms
40,736 KB
testcase_21 AC 108 ms
40,356 KB
testcase_22 AC 112 ms
40,864 KB
testcase_23 AC 111 ms
40,288 KB
testcase_24 AC 82 ms
38,708 KB
testcase_25 AC 112 ms
40,916 KB
testcase_26 AC 85 ms
39,640 KB
testcase_27 AC 113 ms
40,800 KB
testcase_28 AC 119 ms
40,836 KB
testcase_29 AC 108 ms
40,500 KB
testcase_30 AC 112 ms
40,656 KB
testcase_31 AC 108 ms
40,532 KB
testcase_32 AC 86 ms
38,564 KB
testcase_33 AC 111 ms
40,728 KB
testcase_34 AC 101 ms
40,016 KB
testcase_35 AC 104 ms
40,424 KB
testcase_36 AC 108 ms
40,868 KB
testcase_37 AC 109 ms
40,800 KB
testcase_38 AC 103 ms
40,356 KB
testcase_39 AC 104 ms
40,272 KB
testcase_40 AC 107 ms
40,976 KB
testcase_41 AC 109 ms
40,736 KB
testcase_42 AC 106 ms
40,448 KB
testcase_43 AC 114 ms
40,992 KB
testcase_44 AC 115 ms
40,864 KB
testcase_45 AC 85 ms
38,640 KB
testcase_46 AC 75 ms
38,412 KB
testcase_47 AC 75 ms
37,968 KB
testcase_48 AC 77 ms
38,320 KB
testcase_49 AC 76 ms
38,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long mod = 1_000_000_007;
    long inf = Long.MAX_VALUE;

    void solve(){
        char[] s = ns().toCharArray();
        int n = s.length;
        double top3 = 0;
        for(int i = 0; i <= 2; i++){
            top3 += Math.pow(10,1-i)*(s[i]-'0');
        }
        double round_top3 = Math.round(top3);
        if(round_top3==100){
            double top2 = round_top3/100;
            n++;
            out.println(top2+"*10^"+(n-1));
        }
        else{
            double top2 = round_top3/10;
            out.println(top2+"*10^"+(n-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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, 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 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