Search & Filtering
Hallow rect angle
if str1[-1].isdigit():
count+=1
Sum += int(temp)
I cant understand this part of the problem and also please explain the problem fully if it is possible
A customer received the following SMS from his bank:
875088 is SECRET OTP for txn of INR 2000.00 on Axis Bank card XX8911 at IRCTC on 13-02-21 16:09:25. OTP valid for 5 mins. Please do not share this OTP.
Write a Print Statement to generate the above SMS. (You may refer to the example given at the top.)
Write a program that implements
an algorithm using an IDE to solve the
problem at Cloud factory
The program displays random numbers on the screen and requests for the spelling of that number. It checks if the input is correct, then it displays another number. If the input is wrong, then it will send an error message and request another answer with 3 attempts.
Miss Ural wants to buy colors for Holi, and that too, at the cheapest cost!
There are N shops selling colors near Ural's house, where the i′th shop sells colors at rate of Ri for one unit. Also, i′th shop is located at a distance of Di kilometers from her house. Life was simple, but then petrol and fuel prices soared up. The current price of petrol to travel one kilometer is K
Find the minimum cost at which Miss Ural can buy one unit of color. she does not need to return back home.
- The first line of input contains T, number of test cases in a file.
- The next line contains two integers, N and K, as described in the problem statement.
- The next line contains N space separated integers, denoting Di, i.e. distance of the shop.
- The next line contains N space separated integers denoting Ri, i.e. rate of the color.
For test case, output minimum cost to purchase 1 unit of color.
- 1≤T≤10^5
- 1≤N≤10^5
- Sum of N over all T in a test file does not exceed 10^6.
- 1≤Ri,K,Di≤10^9
You are given an array of N non-negative integers: A1, A2, ..., AN. An alternating subsequence is a subsequence in which the indices of any two consecutive elements differ by exactly two in the original array. That is, if Ai1, Ai2, ..., Aik is some subsequence, then for it to be an alternating subsequence, (i2 - i1 = 2), (i3 - i2 = 2), and so on should all hold true. Among all alternating subsequences, find the one which has maximum sum of elements, and output that sum.
Input
The first line of the input contains an integer T denoting the number of test cases.
The first line of each test case contains an integer N denoting the number of elements in the array.
The second line contains N space-separated integers A1, A2, ..., AN denoting the array A.
Output
For each test case, output a single line containing the answer.
Note
A subsequence with only a single integer is also an alternating subsequence.
Constraints
1 ≤ T ≤ 10
1 ≤ N ≤ 105
0 ≤ Ai ≤ 105
name of month
For every program, there should be a softcopy file containing (i) Algorithm/Flowchart, (ii)
Source Code, (iii) Output
Q.Write a menu-driven program, using user-defined functions to find the area of rectangle, square,
circle and triangle by accepting suitable input paramters from user.
For every program, there should be a softcopy file containing (i) Algorithm/Flowchart, (ii)
Source Code, (iii) Output
Q.Write a menu driven program to convert the given temperature from Fahrenheit to Celsius and vice
versa depending upon users choice.
