svce-acm / a-december-of-algorithms-2022 Goto Github PK

I feel like there is some error in the given test cases because according to the question the fuel price increases on every 3rd day by 3 rupees and decreases on every 5th day by 2 rupees.If so the increased price will remain same untill it is decresed by 5th day right?
but the calculations in the test cases are made in such a way that it only increases on 3rd day and the next day it goes to its original value.Can you guys explaing the question well please?
Thank you

PS:) Loved solving these questions thanks to the team for taking such great effects

As you mentioned in the Question that There maybe more than one solution for the given input.
Solution with minimum number of steps should be considered?

Giving the calculation will give the answer to the puzzle.
It is what you must figure out.
I'll give you a hint: you are considering only the first smallest time. You need to consider more than one. I have added a more simple sample for this approach.
The answer is 161 seconds which is equal to 2.683 minutes.

Originally posted by @neha2127 in #68 (comment)

Second Sample Input :- { 1, 4, 7, 8, 3, 2 }
Calculation :- 2+1+8+2+4+1+3+1+2 = 24 seconds = 0.4 minutes

So this is the Dry run for your given Calculation.

Note : In the Question it is already told that there is only 2 Breach Suits Available so one member have to bring the Breach Suit back for remaining Tailie

& I have another doubt that in your given Calculation I can't see 7 seconds.
Have that member never left the Tail Section?

As in Sample Input 1
n = 1 which represents the length of the password
k = 2 which represents that each digit in password will either be 0 or 1 i.e, [0, k-1]

But the output is
00, 01, 10 or 11
above password is of length 2

Same goes for Sample Input 2...

Hello,
I have noticed, for 2021 A-December-of-Algorithms, no pull requests were accepted. Is there any particular reason for doing it? Will the same trend be followed for 2022 as well ?

Personally, I feel merging requests would make it easier for other users to quickly browse between different people's solution without struggle, rather than opeing each pull requests manually, which would discourage users to learn and explore.

Furthermore, cloning the repository would lead to downloading bunch of empty folders with just .gitignore file, and it's counter intutive.

Thank you.

Hey the explanation given by you in the dec 11th problem is not sufficient

CAN YOU GIVE SOME DETAILED EXPLANATION ABOUT HOW THE SCORE IS CALCULATED

AND WHAT IS A JUMP?

IS THE TWO STEP CONSIDERED AS A JUMP
OR EVEN A SINGLE STEP CONSIDERED AS A JUMP

In the input 1 the output is about the no of steps "8"
but in the input 2 it is about the no of jumps "3"

Thankyouu

How does the fuel price fluctuate when it is both the third day and the fifth day, like Day 15 and Day 30?

!! Another list is provided which contains the step that the monkey took Eg[1,1,2,1,2]. (from problem statment)

But That part had not been shown in the sample input
can you show the input for the above!!

Need to check my program with different Input.

For Example if the Sample Input is
1,1,1,1,1,1,1,6,7

According to your Explanation 6 & 7 are maximum heights.
So their is 1unit gap between 6 & 7 and height will be min(6,7) which is 6units. Resultant Area will be 6unit².

But if we take height at 0th Position which is 1 and height at 9th Position which is 7, its resultant area will be 8unit².
Calculation :
Their is 8units gap between 1 & 7 and height will be min(1,7) which is 1unit.

Conslusion :
Area found with 2nd approach is greater than 1st approach.

The array that has the steps made by the monkey is missing please check this out

In the Question it is written that Array must be in Sorted Order but in the Input it is not in Sorted Order

{ 3, 10, 12, 13, 15, 17, 21, 35, 23 }

hey In day 3 . Minesweeper
for this input and output
Input:
5
["-", "#", "-", "-", "#"],
["-", "-", "-", "-", "-"],
["-", "-", "#", "-", "-"],
["-", "#", "-", "-", "#"],
["-", "#", "-", "-", "#"]

Output:

["1", "#", "1", "1", "#"],
["1", "2", "1", "2", "1"],
["1", "2", "#", "1", "1"],
["2", "#", "3", "3", "#"],
["2", "#", "2", "2", "#"]

isint this the correct output?

[1, #, 1, 1, #]
[1, 2, 2, 2, 1]
[1, 2, #, 2, 1]
[2, #, 3, 3, #]
[2, #, 2, 2, #]

if we consider diagonal ?.

thanks.

Input = {1, 4, 3, 6, 2, 1, 8, 1, 3, 7, 7}

After distributing Candies it will be {1, 2, 1, 3, 2, 1, 2, 1, 2, 3, 1}

Minimum Candies will be 19

for this question, day 25 , what does this mean in the explanation

The i-th line in the next N lines contains two numbers, v and x, which are the velocity and the current position of the i-th motorcyclist (1 <= v, x <= 100,000).

if there are only n motorcycles, how is x>n in the testcases?

hey on the 1st question . there is no specific format for inputs.
ive considered the first line of input as number of words and the next lines as space sep hex values.
is this acceptable or is there any specific input format.

thanks

25/156 = 0.160
You have considered this as a Percentage Value which looks like the fuel left is less than 1%

Right value will be 16.026%

Heyy Hii!!
THE CHALLENGE IS GOINGG REALLY WELL

But, what should be done if i was not able to solve some dayyy
it the certificate based of like day 1 to day 10 or any 10 days of the challenge