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.

Category: Teacher Tran Minh Tho

Snail

Threads: Snails Climbing Trees. A snail climbs up 1 A vertical pillar has a height of n cm, During the day it climbs a cm, at night it drops back to b cm. Starting from the foot of the column, How many days will it take it to reach the top of the column?

Insert number V2

Threads: 9.16. Given the sequence of n integers. Enter an integer m and insert it at position k such that the subsequence from 1 up to k is a non-decreasing sequence Input: Integer n and sequence of n integers, integer m Output data: The sequence of numbers after inserting

The longest rising child

Threads: Enter an array of n elements (0<n<256), elements that take integer values (-10e9<a[i]<10e9). Find the non-decreasing subarray (the following element is greater than or equal to the previous element) Maximum Input: Integer n and n integer Output: Length of the largest subsection

The largest sum

Threads: Enter an array of n elements (0<n<256), elements that take integer values (-10e9<a[i]<10e9). Find the subarray with the largest sum Input: Integer n and n integer Output: Maximum sum over 1 line and subparagraph with the greatest sum, if there are many