CSES - KILO 2019 2/5 - Results
Submission details
Task:Onnenluku
Sender:odporkka
Submission time:2019-05-14 17:45:34 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.46 s1details
#20.46 s1details
#30.47 s1details
#40.45 s1details
#50.47 s1details
#60.46 s2details
#70.47 s2details
#80.45 s2details
#90.47 s2details
#100.46 s2details
#110.47 s3details
#120.47 s3details
#130.45 s3details
#140.47 s3details
#150.45 s3details

Code

import java.util.Scanner;

public class Kilpa2 {
	
	static String[] numbers = new String[72];
	
	public static void main(String[] args) {
		int x = 0;
		for (int i = 12; i < 99; i++) {
			if (i%10 != 0 && (i/10 != i%10)) {
				numbers[x] = i + "";
				x++;
			}
		}
		Scanner s = new Scanner(System.in);
		String input = s.nextLine();
		s.close();
		String[] splited = input.split("\\s+");

		//int ans = solve(splited[1]) - solve(splited[0]);
		System.out.println(solve("54321"));
	}

	private static int solve(String n) {
		int ans = numbers.length;
		for (int i = 0; i < numbers.length; i++) {
			String s = numbers[i];
			ans += recursion(s, n, s.charAt(0), s.charAt(1));
		}		
		return ans;	
	}

	private static int recursion(String s, String n, char a, char b) {
		int ans = 0;
		if (Integer.parseInt(s) > Integer.parseInt(n)) return 0;
		if (s.length() == n.length()) {
			System.out.println(s);
			return 1;
		}	
		ans += recursion(s += a, n, a, b);
		s = s.substring(0, s.length() - 1);		
		ans += recursion(s = a + s, n, a, b);
		s = s.substring(1, s.length());	
		ans += recursion(s+=b, n, a, b);
		return ans;
	}

}

Test details

Test 1

Group: 1

Verdict:

input
2157 93337

correct output
1421

user output
12111
11211
12112
11211
11121
...

Test 2

Group: 1

Verdict:

input
4875 95124

correct output
1278

user output
12111
11211
12112
11211
11121
...

Test 3

Group: 1

Verdict:

input
5577 96352

correct output
1245

user output
12111
11211
12112
11211
11121
...

Test 4

Group: 1

Verdict:

input
8362 92950

correct output
1076

user output
12111
11211
12112
11211
11121
...

Test 5

Group: 1

Verdict:

input
5658 96660

correct output
1238

user output
12111
11211
12112
11211
11121
...

Test 6

Group: 2

Verdict:

input
51312303535233 994542403556353

correct output
1453976

user output
12111
11211
12112
11211
11121
...

Test 7

Group: 2

Verdict:

input
25636920452341 934558290712847

correct output
1544072

user output
12111
11211
12112
11211
11121
...

Test 8

Group: 2

Verdict:

input
7917952071965 985207415843573

correct output
1763176

user output
12111
11211
12112
11211
11121
...

Test 9

Group: 2

Verdict:

input
48991581181227 907034837225965

correct output
1380248

user output
12111
11211
12112
11211
11121
...

Test 10

Group: 2

Verdict:

input
47968703305149 924246001328437

correct output
1396632

user output
12111
11211
12112
11211
11121
...

Test 11

Group: 3

Verdict:

input
292953755324413237753216241025...

correct output
53286731528535944

user output
12111
11211
12112
11211
11121
...

Test 12

Group: 3

Verdict:

input
373990979330820426927419348165...

correct output
51580289482227600

user output
12111
11211
12112
11211
11121
...

Test 13

Group: 3

Verdict:

input
701417326319476057561825658890...

correct output
42924933948374952

user output
12111
11211
12112
11211
11121
...

Test 14

Group: 3

Verdict:

input
177202883511434557056457305647...

correct output
54500592365600640

user output
12111
11211
12112
11211
11121
...

Test 15

Group: 3

Verdict:

input
977665117437419620152569155919...

correct output
38562071809359800

user output
12111
11211
12112
11211
11121
...