Submission #342235
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; class Myon { public Myon() { } public static int Main() { new Myon().calc(); return 0; } void calc() { Scanner cin = new Scanner(); long N = cin.nextLong(); List<long> l = new List<long>(); for (long i = Math.Max(1, N - 200); i <= N; i++) { if (i + f(i) == N) l.Add(i); } Console.WriteLine(l.Count); foreach (var item in l) { Console.WriteLine(item); } } int f(long a) { int ret = 0; while (a > 0) { ret += (int)(a % 10); a /= 10; } return ret; } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return s[i++]; } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } } class XRand { uint x, y, z, w; public XRand() { init(); } public XRand(uint s) { init(); init_xor128(s); } void init() { x = 314159265; y = 358979323; z = 846264338; w = 327950288; } public void init_xor128(uint s) { z ^= s; z ^= z >> 21; z ^= z << 35; z ^= z >> 4; z *= 736338717; } uint next() { uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8; } public long nextLong(long m) { return (long)((((ulong)next() << 32) + next()) % (ulong)m); } public int nextInt(int m) { return (int)(next() % m); } public long nextLong(long min, long max) { return min + nextLong(max - min + 1); } public int nextInt(int min, int max) { return min + nextInt(max - min + 1); } public int nextIntP(int a) { return (int)Math.Pow(a, nextDouble()); } public int nextIntP(int min, int max) { int diff = max - min; return min + nextIntP(diff + 2) - 1; } public long nextLongP(long a) { return (long)Math.Pow(a, nextDouble()); } public long nextLongP(long min, long max) { long diff = max - min; return min + nextLongP(diff + 2) - 1; } public double nextDouble() { return (double)next() / uint.MaxValue; } public double nextDoubleP(double a) { return Math.Pow(a, nextDouble()); } }
Submission Info
Submission Time | |
---|---|
Task | B - 方程式 |
User | chokudai |
Language | C# (Mono 2.10.8.1) |
Score | 100 |
Code Size | 3179 Byte |
Status | AC |
Exec Time | 112 ms |
Memory | 7832 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 80 / 80 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt |
Subtask2 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 108 ms | 7828 KB |
subtask0_sample_02.txt | AC | 106 ms | 7768 KB |
subtask0_sample_03.txt | AC | 106 ms | 7760 KB |
subtask1_01.txt | AC | 106 ms | 7760 KB |
subtask1_02.txt | AC | 108 ms | 7796 KB |
subtask1_03.txt | AC | 105 ms | 7732 KB |
subtask1_04.txt | AC | 106 ms | 7820 KB |
subtask1_05.txt | AC | 106 ms | 7776 KB |
subtask1_06.txt | AC | 106 ms | 7760 KB |
subtask1_07.txt | AC | 106 ms | 7820 KB |
subtask1_08.txt | AC | 108 ms | 7820 KB |
subtask1_09.txt | AC | 108 ms | 7760 KB |
subtask1_10.txt | AC | 107 ms | 7824 KB |
subtask1_11.txt | AC | 105 ms | 7792 KB |
subtask1_12.txt | AC | 106 ms | 7780 KB |
subtask1_13.txt | AC | 107 ms | 7732 KB |
subtask1_14.txt | AC | 107 ms | 7756 KB |
subtask1_15.txt | AC | 105 ms | 7828 KB |
subtask2_16.txt | AC | 110 ms | 7824 KB |
subtask2_17.txt | AC | 107 ms | 7772 KB |
subtask2_18.txt | AC | 110 ms | 7820 KB |
subtask2_19.txt | AC | 109 ms | 7760 KB |
subtask2_20.txt | AC | 107 ms | 7824 KB |
subtask2_21.txt | AC | 106 ms | 7832 KB |
subtask2_22.txt | AC | 111 ms | 7816 KB |
subtask2_23.txt | AC | 109 ms | 7824 KB |
subtask2_24.txt | AC | 111 ms | 7780 KB |
subtask2_25.txt | AC | 110 ms | 7820 KB |
subtask2_26.txt | AC | 109 ms | 7792 KB |
subtask2_27.txt | AC | 110 ms | 7764 KB |
subtask2_28.txt | AC | 112 ms | 7764 KB |
subtask2_29.txt | AC | 108 ms | 7820 KB |
subtask2_30.txt | AC | 108 ms | 7760 KB |