Popular posts from this blog
ATM solution in C language.- Codechef
ATM Problem Code: HS08TEST Pooja would like to withdraw X $US from an ATM. The cash machine will only accept the transaction if X is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction (including bank charges). For each successful withdrawal the bank charges 0.50 $US. Calculate Pooja's account balance after an attempted transaction. Input Positive integer 0 < X <= 2000 - the amount of cash which Pooja wishes to withdraw. Nonnegative number 0<= Y <= 2000 with two digits of precision - Pooja's initial account balance. Output Output the account balance after the attempted transaction, given as a number with two digits of precision. If there is not enough money in the account to complete the transaction, output the current bank balance. Example - Successful Transaction Input: 30 120.00 Output: 89.50 Example - Incorrect Withdrawal Amount (not multiple of 5) Input: 42 12...
Prefix Sums solution in C++ language.- Codechef
Prefix Sums Problem Code: UNQEQ For a positive, even even integer � N , we call a pair of arrays � A and � B to be interesting if they satisfy the following conditions : ∣ � ∣ = ∣ � ∣ = � / 2 ∣ A ∣ = ∣ B ∣ = N /2 i.e. the length of array � A is equal to the length of array � B . Each integer from 1 1 to � N occurs exactly once in exactly one of the arrays. The � � ℎ i t h prefix sum of � A is not equal to � � ℎ i t h prefix sum of � B for all 1 ≤ � ≤ � / 2 − 1 1 ≤ i ≤ N /2 − 1 . Formally, ∑ � = 1 � � � ≠ ∑ � = 1 � � � j = 1 ∑ i A j = j = 1 ∑ i B j for all 1 ≤ � ≤ � / 2 − 1 1 ≤ i ≤ N /2 − 1 Sum of all elements in � A is equal to sum of all elements in � B i.e. ∑ � = 1 � / 2 � � = ∑ � = 1 � / 2 � � j = 1 ∑ N /2 A j = j = 1 ∑ N /2 B j You are given a p...



Comments
Post a Comment