結果
問題 | No.746 7の倍数 |
ユーザー | tutuz |
提出日時 | 2018-10-19 23:45:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 440 ms / 2,000 ms |
コード長 | 2,979 bytes |
コンパイル時間 | 2,284 ms |
コンパイル使用メモリ | 82,116 KB |
実行使用メモリ | 46,600 KB |
最終ジャッジ日時 | 2024-04-29 17:14:57 |
合計ジャッジ時間 | 8,978 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,980 KB |
testcase_01 | AC | 57 ms
37,204 KB |
testcase_02 | AC | 59 ms
37,388 KB |
testcase_03 | AC | 440 ms
46,240 KB |
testcase_04 | AC | 75 ms
38,376 KB |
testcase_05 | AC | 137 ms
41,308 KB |
testcase_06 | AC | 241 ms
45,448 KB |
testcase_07 | AC | 222 ms
45,088 KB |
testcase_08 | AC | 272 ms
45,492 KB |
testcase_09 | AC | 216 ms
45,140 KB |
testcase_10 | AC | 140 ms
41,092 KB |
testcase_11 | AC | 394 ms
46,276 KB |
testcase_12 | AC | 430 ms
46,600 KB |
testcase_13 | AC | 308 ms
45,588 KB |
testcase_14 | AC | 350 ms
46,080 KB |
testcase_15 | AC | 327 ms
46,260 KB |
testcase_16 | AC | 347 ms
46,144 KB |
testcase_17 | AC | 319 ms
45,292 KB |
testcase_18 | AC | 337 ms
45,824 KB |
testcase_19 | AC | 323 ms
45,700 KB |
testcase_20 | AC | 210 ms
45,076 KB |
testcase_21 | AC | 150 ms
42,616 KB |
testcase_22 | AC | 407 ms
46,124 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.math.BigInteger; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); if (n == 0) { out.println(0); return; } BigInteger bunsi = new BigInteger("10").pow(n).divide(new BigInteger("7")); out.println("0." + bunsi.toString()); } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }