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:Bạn được yêu cầu viết 1 chương trình tính toán với công việc như sau: Cho một số n là số năm, hãy tính giá trị của năm đó. Ta có giá trị của 1 ngày được tính bởi công thức: Val = tổng các chữ số của ngày + tổng các chữ số
Threads: Given an integer array of n (1<n<1000) element, (-100<a[i]<=100). Please write CT to do the following things 1. Remove duplicate elements, just keep 1 element each type 2. Remove all elements that are primes. 3. Find the UCLN of the remaining elements,
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
Threads: 9.16. Write a program to insert an integer m into an array of n integers sorted in ascending order so that the sequence of numbers after insertion still preserves its sort order.. Number series, number of terms and integers needed
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
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
Threads: VCT inputs an array of n integers. Output the subsegments with the most positive integers. Input: Consists of positive integers n and n integers Output: Current 1 is the number of positive numbers, the following lines are the subsegments with the most positive integers.
Threads: VCT inputs an array of n integers. Output the sub-segment with the most positive integers. Input: Consists of positive integers n and n integers Output: Current 1 is the number of positive numbers, current 2 is the subsegment with the most positive integers, if there are multiple paragraphs
Threads: Nam's house is near National Highway 1A, Every day, a lot of cars from other provinces pass by Nam's house, a free Sunday, Nam decided he would observe and record 2 The first letter of the license plate and then calculate it
Threads: Enter a numeric array of n elements. Check that this is an ascending array, or gradually decrease, or neither increase nor decrease. Ascending array is larger array that follows the previous number, Descending array is where the previous number is greater than the next number. Input: The first line is an integer