Please write the programs in python. Let there are N numbers in a list and that list is said to be a UB Jumper if the absolute values of the difference between the successive elements take on all the values 1 through N − 1. For example, 2 1 4 6 10 is a UB Jumper because the absolute differences between them are 1 3 2 4 which is all numbers from 1 to (5 - 1) or 4. Write a python program that takes a number sequence as input and prints whether it is a UB Jumper or Not UB Jumper. Input will stop after getting “STOP” as input. (Number order or absolute difference order doesn’t follow any sequence.) Sample Input 1423 2 1 4 6 10 1 4 2 -1 6 STOP Sample Output UB Jumper UB Jumper Not UB Jumper
Please write the programs in python.
Let there are N numbers in a list and that list is said to be a UB Jumper if the absolute values of the difference between the successive elements take on all the values 1 through N − 1. For example, 2 1 4 6 10 is a UB Jumper because the absolute differences between them are 1 3 2 4 which is all numbers from 1 to (5 - 1) or 4. Write a python program that takes a number sequence as input and prints whether it is a UB Jumper or Not UB Jumper. Input will stop after getting “STOP” as input. (Number order or absolute difference order doesn’t follow any sequence.)
Sample Input
1423
2 1 4 6 10 1 4 2 -1 6
STOP
Sample Output
UB Jumper
UB Jumper Not UB Jumper
You are given a string that contains alphanumeric characters only. Your task is to sort the string in the following manner:
-
All sorted lowercase letters are ahead of uppercase letters.
-
All sorted uppercase letters are ahead ofdigits.
-
All sorted odd digits are ahead of sorted even digits.
Sample Input
Bracu1234
Sample Output
acruB1324
An University has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship at most 5 times.
The head of the University ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?
The first line of input contains two integers, n and k. The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-thperson participated in the ACM ICPC Regional .
Write a python program that prints how many teams can be formed according to the above problem statement.
Sample Input 1
52 04510
Sample Input 2
64 012345
Sample Input 3
65 000000
Sample Output 1 1
Sample Output 2 0
Sample Output 3 2
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
