WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.
Threads: Find the prime number at position i Input: T number of tests, T corresponding testcases. Output: Prime numbers at testcase positions. Suggestions: Use the elemental sieve to complete the Example exercise: input: 3 2 3 5 output: 3 5 7
Threads:Given a number n, Check if the number is prime or not! Input: A unique number n. n <= 10^18 Output: Yes if it is a prime number, No if it's the opposite. For example: input: 3 output: Yes
Threads: Given a positive integer x. Find pairs of positive integers (a, b) satisfied: UCLN(a, b) + BCNN(a, b) = x. In there: UCLN(a, b) is the greatest common divisor of 2 numbers a and b. BCNN(a, b) is the least common multiple of 2 numbers a and b. Input: Current
Threads: “Throw the dog to death” is a saying often used to refer to phones “brick” once upon a time. Today, We will have a little exercise about these legendary phones. Let n be a string of numbers (contains only characters 0,1,2,3,4,5,6,7,8,9). Based on the picture
