結果

問題 No.219 巨大数の概算
ユーザー EmKjpEmKjp
提出日時 2015-05-29 22:36:51
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 98 ms / 1,500 ms
コード長 2,995 bytes
コンパイル時間 2,404 ms
コンパイル使用メモリ 105,948 KB
実行使用メモリ 29,352 KB
最終ジャッジ日時 2023-09-25 13:29:14
合計ジャッジ時間 10,945 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
27,336 KB
testcase_01 AC 95 ms
27,332 KB
testcase_02 AC 97 ms
27,340 KB
testcase_03 AC 96 ms
27,264 KB
testcase_04 AC 94 ms
24,976 KB
testcase_05 AC 58 ms
21,068 KB
testcase_06 AC 61 ms
21,192 KB
testcase_07 AC 58 ms
21,068 KB
testcase_08 AC 61 ms
19,180 KB
testcase_09 AC 57 ms
21,268 KB
testcase_10 AC 96 ms
27,424 KB
testcase_11 AC 95 ms
25,204 KB
testcase_12 AC 95 ms
23,192 KB
testcase_13 AC 96 ms
27,268 KB
testcase_14 AC 95 ms
25,148 KB
testcase_15 AC 96 ms
27,256 KB
testcase_16 AC 95 ms
27,336 KB
testcase_17 AC 94 ms
25,364 KB
testcase_18 AC 97 ms
27,372 KB
testcase_19 AC 96 ms
27,288 KB
testcase_20 AC 97 ms
27,268 KB
testcase_21 AC 95 ms
23,316 KB
testcase_22 AC 97 ms
27,236 KB
testcase_23 AC 96 ms
25,276 KB
testcase_24 AC 97 ms
25,312 KB
testcase_25 AC 96 ms
27,332 KB
testcase_26 AC 98 ms
29,336 KB
testcase_27 AC 96 ms
29,320 KB
testcase_28 AC 96 ms
25,308 KB
testcase_29 AC 95 ms
27,280 KB
testcase_30 AC 96 ms
27,296 KB
testcase_31 AC 96 ms
27,264 KB
testcase_32 AC 97 ms
25,180 KB
testcase_33 AC 96 ms
25,300 KB
testcase_34 AC 98 ms
25,292 KB
testcase_35 AC 97 ms
27,296 KB
testcase_36 AC 95 ms
25,168 KB
testcase_37 AC 97 ms
27,212 KB
testcase_38 AC 97 ms
25,280 KB
testcase_39 AC 96 ms
25,236 KB
testcase_40 AC 96 ms
27,200 KB
testcase_41 AC 97 ms
25,172 KB
testcase_42 AC 96 ms
25,372 KB
testcase_43 AC 97 ms
27,272 KB
testcase_44 AC 97 ms
27,312 KB
testcase_45 AC 96 ms
25,316 KB
testcase_46 AC 94 ms
25,304 KB
testcase_47 AC 97 ms
25,328 KB
testcase_48 AC 95 ms
29,352 KB
testcase_49 AC 97 ms
27,224 KB
testcase_50 AC 97 ms
27,332 KB
testcase_51 AC 59 ms
23,244 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;

partial class Solver {
    public void Run() {
        var n = ni();
        for (int i = 0; i < n; i++) {
            var a = ni();
            var b = ni();
            var logAB = Math.Log10(a) * b;
            var z = (long)(logAB);
            var v = Math.Pow(10, logAB - z);
            var x = (long)v;
            var y = (long)(v * 10) % 10;
            cout.WriteLine(x + " " + y + " " + z);
        }
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public string ns() { return Next(); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0