Task: | Kertoma |
Sender: | Septicuss |
Submission time: | 2022-10-31 02:10:40 +0200 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | TIME LIMIT EXCEEDED | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.07 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.07 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.07 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.07 s | 1, 2, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.io.PrintWriter;import java.math.BigInteger;import java.util.StringTokenizer;public class C430 {static int[] array;static int digits = 0;static long currentN = 2;static boolean solved = false;public static void main(String[] args) {FastReader reader = new FastReader();PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));array = new int[10];// 100000// 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000for (int i = 0; i < array.length; i++) {int num = reader.nextInt();array[i] = num;digits += num;}reader.close();findLowest();// System.out.println("CURRENT N = " + currentN);while (!solved) {solve();}writer.println(currentN);writer.flush();writer.close();}static void findLowest() {long difference = digits - countDigits(currentN);if (difference == -1) {// System.out.println("Difference was -1");return;}if (difference > 0) {currentN += difference >= 1000 ? 100 : 1;findLowest();}}static long countDigits(long n) {double total = 0;for (long i = 2; i <= n; i++)total += Math.log10(i);return (int) (Math.floor(total)) + 1;}static void solve() {// System.out.println("SOLVING FACTORIAL WITH " + currentN);for (int i = 0; i < array.length; i++) {long count = count(factorial(currentN), i);if (count != array[i]) {currentN += 1;return;}}solved = true;}static int count(BigInteger n, int d) {int count = 0;for (long i = n.longValue(); i > 0; i /= 10) {if (i % 10 == d) {count += 1;}}return count;}static BigInteger factorial(long number) {BigInteger factorial = BigInteger.ONE;for (long i = number; i > 0; i--) {factorial = factorial.multiply(BigInteger.valueOf(i));}return factorial;}static class FastReader {private BufferedReader br;private StringTokenizer st;public FastReader() {br = new BufferedReader(new InputStreamReader(System.in));}void close() {try {br.close();} catch (IOException e) {e.printStackTrace();}st = null;br = null;}String next() {while (st == null || !st.hasMoreElements()) {try {st = new StringTokenizer(br.readLine());} catch (IOException e) {e.printStackTrace();}}return st.nextToken();}String nextLine() {String str = "";try {str = br.readLine();} catch (IOException e) {e.printStackTrace();}return str;}int nextInt() {return Integer.parseInt(next());}BigInteger nextBigInteger() {return new BigInteger(next());}double nextDouble() {return Double.parseDouble(next());}long nextLong() {return Long.parseLong(next());}}}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
0 0 1 0 0 0 0 0 0 0 |
correct output |
---|
2 |
user output |
---|
2 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
0 0 0 0 0 0 1 0 0 0 |
correct output |
---|
3 |
user output |
---|
3 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
0 0 1 0 1 0 0 0 0 0 |
correct output |
---|
4 |
user output |
---|
4 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
2 0 1 1 0 0 1 0 2 0 |
correct output |
---|
10 |
user output |
---|
10 |
Test 5
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
9 3 1 1 2 2 3 1 6 1 |
correct output |
---|
27 |
user output |
---|
(empty) |
Test 6
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
10 4 3 4 3 2 2 4 3 7 |
correct output |
---|
36 |
user output |
---|
(empty) |
Test 7
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
71 53 36 30 25 29 42 24 34 29 |
correct output |
---|
199 |
user output |
---|
(empty) |
Test 8
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
71 33 46 38 27 45 36 21 35 35 |
correct output |
---|
205 |
user output |
---|
(empty) |
Test 9
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
93 38 35 26 43 54 38 25 41 34 |
correct output |
---|
222 |
user output |
---|
(empty) |
Test 10
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 33 33 45 36 43 38 54 56 36 |
correct output |
---|
242 |
user output |
---|
(empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
3419 1797 1845 1849 1879 1791 ... |
correct output |
---|
5959 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
4776 2695 2709 2781 2616 2753 ... |
correct output |
---|
8391 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
20097 12282 12229 12214 12406 ... |
correct output |
---|
32001 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
47934 29918 29878 29713 29984 ... |
correct output |
---|
71718 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
84691 54156 54277 54533 54296 ... |
correct output |
---|
123123 |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
99098 63339 63878 64182 63904 ... |
correct output |
---|
142663 |
user output |
---|
(empty) |