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: Lee has an infinite number of candy bags in turn 6, 9 and 20 the candy. Have 1 the customer wants to buy n candies, Lee wants to sell as many bags of candy as possible. Help Lee figure out the maximum number of candy bags sold, know that she won't be sold

Threads: The palindromic number is a number that is the same when written forward or backwards. Therefore, The first few palindromic numbers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, … (Rule 1). In some cases

Threads:Counts the number of primes less than or equal to n. Input: A unique number n. n <= 5*10^9. Output: Number of primes less than or equal to n. For example: input: 3 output: 2

Threads:Given a number n, sum the divisors of the number n(n . not included)! Input: A unique number n. N <= 10^18. Output: Sum of the divisors of n. Suggestions: check prime number first. For example: input: 3 output: 1

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

## Comment