Sesiones de PyR
Matt reaches the final round of a treasure hunt. In this, he finds that as he proceeds there are flags with the number written on them at different positions. The difference between two consecutive flags can be either a or b. If he finds the number on the first flag is 0. Given three integer, first one is number of flags present, second is a and third is b. then return all the possible values for last flag for each test case.
hunt({3 1 2}) = {2 3 4}
0 Votos
2 Respuestas
En tendencia hoy
Marquee
1 Votes
Any Advise?
1 Votes
Popsacles Aufgabe
1 Votes
Button In C++
1 Votes
C#
0 Votes
%
0 Votes