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: 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: 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: 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
Threads: Write a program to input an array of real numbers consisting of n elements (2<n<1000) which has the least 2 number 0. Calculate the sum of the elements in the middle of the number 0 first and number 0 Final. Input: current 1 including 1 integer n, current 2 n real numbers in it
Threads: Total 2 phân số a/b và c/d, sau đó tối giản phân số kết quả thu được Dữ liệu vào: 4 number a,b,c,d (điều kiện 0<a,b,c,d<=10000); Dữ liệu ra: Phân số tối giản e/f Ví dụ: Input 2 5 3 6 xuất ra 9/10 (giải thích 2/5+3/6=27/30=9/10)
