Submission #958384
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.util.*; import java.util.function.BiFunction; import java.util.function.Function; import java.util.function.Supplier; public class Main { void run() { int n = ni() - 1; int v = n / 9; int a = n % 9; int ans = 0; for (int i = 0; i <= v; ++i) { ans = ans * 10 + a + 1; } System.out.println(ans); } Scanner sc = new Scanner(System.in); public static void main(String[] args) { new Main().run(); } int ni() { return Integer.parseInt(sc.next()); } void debug(Object... os) { System.err.println(Arrays.deepToString(os)); } class BIT<T> { int n; ArrayList<T> bit; BiFunction<T, T, T> bif; /** * 1-indexed なBinary Indexed Treeを構築する * * @param n 容量 * @param bif 適用させる関数 * @param sup 初期値 */ BIT(int n, BiFunction<T, T, T> bif, Supplier<T> sup) { this.n = n; bit = new ArrayList<>(n + 1); for (int i = 0; i < n + 1; ++i) { bit.add(sup.get()); } this.bif = bif; } /** * iの位置の値をvで更新する * * @param i index * @param v 新しい値 */ void update(int i, T v) { for (int x = i; x <= n; x += x & -x) { bit.set(x, bif.apply(bit.get(x), v)); } } /** * クエリー * * @param defaultValue 初期値 * @param i index * @return [1, i]までfを適用した結果 */ T reduce(T defaultValue, int i) { T ret = defaultValue; for (int x = i; x > 0; x -= x & -x) { ret = bif.apply(ret, bit.get(x)); } return ret; } } long MOD = 1_000_000_007; /** * 繰り返し2乗法を用いたべき乗の実装 * * @return a^r (mod 1,000,000,007) */ long pow(long a, long r) { long sum = 1; while (r > 0) { if ((r & 1) == 1) { sum *= a; sum %= MOD; } a *= a; a %= MOD; r >>= 1; } return sum; } /** * 組み合わせ * O(n) * * @return {}_nC_r */ long C(int n, int r) { long sum = 1; for (int i = n; 0 < i; --i) { sum *= i; sum %= MOD; } long s = 1; for (int i = r; 0 < i; --i) { s *= i; s %= MOD; } sum *= pow(s, MOD - 2); sum %= MOD; long t = 1; for (int i = n - r; 0 < i; --i) { t *= i; t %= MOD; } sum *= pow(t, MOD - 2); sum %= MOD; return sum; } double GOLDEN_RATIO = (1.0 + Math.sqrt(5)) / 2.0; /** * 黄金分割探索 * * @param left 下限 * @param right 上限 * @param f 探索する関数 * @param comp 上に凸な関数を探索するときは、Comparator.comparingDouble(Double::doubleValue) * 下に凸な関数を探索するときは、Comparator.comparingDouble(Double::doubleValue).reversed() * @return 極値の座標x */ double goldenSectionSearch(double left, double right, Function<Double, Double> f, Comparator<Double> comp) { double c1 = divideInternally(left, right, 1, GOLDEN_RATIO); double c2 = divideInternally(left, right, GOLDEN_RATIO, 1); double d1 = f.apply(c1); double d2 = f.apply(c2); while (right - left > 1e-9) { if (comp.compare(d1, d2) > 0) { right = c2; c2 = c1; d2 = d1; c1 = divideInternally(left, right, 1, GOLDEN_RATIO); d1 = f.apply(c1); } else { left = c1; c1 = c2; d1 = d2; c2 = divideInternally(left, right, GOLDEN_RATIO, 1); d2 = f.apply(c2); } } return right; } /** * [a,b]をm:nに内分する点を返す */ double divideInternally(double a, double b, double m, double n) { return (n * a + m * b) / (m + n); } /** * http://qiita.com/p_shiki37/items/65c18f88f4d24b2c528b */ static class FastScanner { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } 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(); } } } }
Submission Info
Submission Time | |
---|---|
Task | A - ゾロ目数 |
User | arukuka |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 6076 Byte |
Status | AC |
Exec Time | 322 ms |
Memory | 29168 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 282 ms | 29100 KB |
sample_02.txt | AC | 283 ms | 29036 KB |
sample_03.txt | AC | 283 ms | 29144 KB |
test_01.txt | AC | 283 ms | 29104 KB |
test_02.txt | AC | 282 ms | 29168 KB |
test_03.txt | AC | 277 ms | 29032 KB |
test_04.txt | AC | 279 ms | 29080 KB |
test_05.txt | AC | 277 ms | 29028 KB |
test_06.txt | AC | 278 ms | 28996 KB |
test_07.txt | AC | 281 ms | 29080 KB |
test_08.txt | AC | 279 ms | 29128 KB |
test_09.txt | AC | 285 ms | 28996 KB |
test_10.txt | AC | 281 ms | 29056 KB |
test_11.txt | AC | 283 ms | 29020 KB |
test_12.txt | AC | 282 ms | 29108 KB |
test_13.txt | AC | 282 ms | 29132 KB |
test_14.txt | AC | 277 ms | 29040 KB |
test_15.txt | AC | 285 ms | 29036 KB |
test_16.txt | AC | 284 ms | 29104 KB |
test_17.txt | AC | 281 ms | 29144 KB |
test_18.txt | AC | 283 ms | 29044 KB |
test_19.txt | AC | 282 ms | 29064 KB |
test_20.txt | AC | 280 ms | 29088 KB |
test_21.txt | AC | 282 ms | 29040 KB |
test_22.txt | AC | 278 ms | 29132 KB |
test_23.txt | AC | 282 ms | 29044 KB |
test_24.txt | AC | 289 ms | 29052 KB |
test_25.txt | AC | 291 ms | 29032 KB |
test_26.txt | AC | 282 ms | 29052 KB |
test_27.txt | AC | 283 ms | 29048 KB |
test_28.txt | AC | 282 ms | 29072 KB |
test_29.txt | AC | 277 ms | 29040 KB |
test_30.txt | AC | 278 ms | 29052 KB |
test_31.txt | AC | 282 ms | 29120 KB |
test_32.txt | AC | 282 ms | 29056 KB |
test_33.txt | AC | 288 ms | 29076 KB |
test_34.txt | AC | 280 ms | 29052 KB |
test_35.txt | AC | 286 ms | 29060 KB |
test_36.txt | AC | 284 ms | 29112 KB |
test_37.txt | AC | 285 ms | 29124 KB |
test_38.txt | AC | 285 ms | 29092 KB |
test_39.txt | AC | 286 ms | 29084 KB |
test_40.txt | AC | 322 ms | 29128 KB |
test_41.txt | AC | 285 ms | 29064 KB |
test_42.txt | AC | 285 ms | 29088 KB |
test_43.txt | AC | 281 ms | 29072 KB |
test_44.txt | AC | 281 ms | 29112 KB |
test_45.txt | AC | 279 ms | 29088 KB |
test_46.txt | AC | 281 ms | 29124 KB |
test_47.txt | AC | 280 ms | 29068 KB |