Category: Exercise

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

Threads:Một số được gọi là “phong phú” nếu như tổng các ước số nguyên dương của a (trừ chính a) mà >= a và <= n. Hãy đếm xem có bao nhiêu số “phong phú” trong khoảng [2, n]. For example: Với n = 20 thì kết quả = 2 Ta có 2 cặp

Threads: Enter an array of n elements, Each element receives a value from 1 come 100; Re-export the array after deleting all duplicate elements. Input data: Current 1 integer n, current 2 and n Output Data elements: 1 Single line of values

Threads:Nam là một sinh viên nghiệm game, trong một lần gặp gỡ Ad đã khuyên cậu ấy bỏ game và chỉ cho Nam một phương pháp. Trong vòng N ngày liên tiếp, mỗi ngày cậu phải giảm D phút chơi game. Sau N ngày, cậu đã chơi tổng S thời gian. Sau một thời

Threads: Class 81 Every month, we organize monthly birthday parties for students in the class. Please count the number of students with birthdays in each month of the class 81 Let the class president prepare to buy gifts. Input data includes: 2 current, first line

Threads: Write a program to input an integer array of n elements (1<n<10000). Enter an integer x and position k (0<k<=n+1), Insert number x into position k in the above array. Input: Including 4 current: current 1 Integer n, current 2 n integers separated by spaces, current

Threads: Write a program to input an integer array of n elements (2<n<1000). Change the positions of the largest and smallest numbers in the above sequence. If there are many largest numbers, multiple smallest numbers, then change the position of the largest number to the smallest and smallest numbers