Submit solution
Points:
12 (partial)
Time limit:
0.5s
Memory limit:
1G
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
digits is a
-level prime pair certificate. Leading zeroes are not permitted.
Given two integers and
, compute the smallest
-level prime pair certificate greater than or equal to
.
Constraints
The output will never exceed .
There are no subtasks for this problem.
Input Specification
The input will consist of two positive space separated integers, and
.
Output Specification
Output the smallest -level prime pair certificate greater than or equal to
.
Sample Input
2 11328
Sample Output
11329
Comments
This comment is hidden due to too much negative feedback. Click here to view it.