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: Write a program to input an array of integers. Sort the array in ascending order Input: include 2 current, The first line is an integer number of elements of the sequence, second line 2 is a sequence of n integers (n>=1), Each integer is separated by a space. Output: to be
Threads: They want to investigate the weight of n students in class 8 Tran Quang Khai Secondary School. Write a program to input an integer (1<n <=150) is the number of students to be investigated and the sequence includes n integers a1,a2,a3,…an (0<ai<100) is the weight of each student
Threads: Along the side of the highway, people put up columns of columns to make barriers. Columns are numbered from 1 onwards. The even columns are coated with reflective paint. Columns with even numbers are not divisible by 4 to be painted over an area of 1×1, columns with numbers
Threads: Write a program to find the maximum sum of the sub-ranges in the array. Input: The first line with N is the number of elements in the array. The next line contains the ith elements of the Output array: Maximum sum of a subset Example: input: 6 -2 11 -4 13
Threads: Let n seeds with a corresponding number of flowering days d1, d2, …, dn. A farmer grows a seed a day. Write a program to find the earliest number of days so that the farmer will have a garden party when all the seeds have grown
Threads: Vinh works for an ATM manufacturing company. The basic function of an ATM is to withdraw cash. When a customer wants to withdraw W dong, The ATM will give out N notes with a total of W dong. In the next generation ATM, Vinh
Threads: There are N cakes, each cake has a radius of ri (corresponding to the i th cake). All N pies have equal and equal height 1. It is necessary to divide N pies into F pies, satisfying the condition that F possible pancakes
Threads: Game TicTacToe is a reduced version of checkerboard game with board game as a board 3 x 3. Game includes 2 player, each turn 1 the player will check the box in the board. Player 1 will mark ‘x’, The second player will hit
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
