CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:Septicuss
Submission time:2022-10-31 01:54:46 +0200
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1, 2, 3details
#20.07 s1, 2, 3details
#3ACCEPTED0.07 s1, 2, 3details
#4ACCEPTED0.07 s1, 2, 3details
#5ACCEPTED0.07 s1, 2, 3details
#6ACCEPTED0.07 s1, 2, 3details
#7ACCEPTED0.07 s2, 3details
#8ACCEPTED0.07 s2, 3details
#9ACCEPTED0.07 s2, 3details
#10ACCEPTED0.07 s2, 3details
#11ACCEPTED0.14 s3details
#12ACCEPTED0.14 s3details
#13ACCEPTED0.42 s3details
#14--3details
#15--3details
#16--3details

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 10000


		for (int i = 0; i < array.length; i++) {
			int num = reader.nextInt();
			digits += num;
			array[i] = num;
		}

//		System.out.println("DIGITS = " + digits);

		reader.close();

		findLowest();

//		while (!solved) {
//			solve();
//		}

		writer.println(currentN);
		writer.flush();
		writer.close();
	}

	static void findLowest() {

		long difference = digits - countDigits(currentN);
//		System.out.println("---");
//		System.out.println("CURRENT N = " + currentN);
//		System.out.println("DIFFERENCE = " + difference);

		if (difference == -1) {
			currentN = 0;
			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() {
		for (int i = 0; i < array.length; i++) {
			String factorial = factorial(currentN).toString();
			final char c = (char) (i + '0');
			long count = factorial.toString().chars().filter(ch -> ch == c).count();

			if (count != array[i]) {
				currentN += 1;
				return;
			}
		}

		solved = true;
	}

	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:

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
2

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: ACCEPTED

input
9 3 1 1 2 2 3 1 6 1

correct output
27

user output
27

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4 3 4 3 2 2 4 3 7

correct output
36

user output
36

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
71 53 36 30 25 29 42 24 34 29

correct output
199

user output
199

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
71 33 46 38 27 45 36 21 35 35

correct output
205

user output
205

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
93 38 35 26 43 54 38 25 41 34

correct output
222

user output
222

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
100 33 33 45 36 43 38 54 56 36

correct output
242

user output
242

Test 11

Group: 3

Verdict: ACCEPTED

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
5959

Test 12

Group: 3

Verdict: ACCEPTED

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
8391

Test 13

Group: 3

Verdict: ACCEPTED

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
32001

Test 14

Group: 3

Verdict:

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
(empty)

Test 15

Group: 3

Verdict:

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
(empty)

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
(empty)