Once Nihar, the hacker claimed that he can know the number of views of each and every problem on Brilliant. But then Azhaghu was confused and thought how can Nihar do this? Then Nihar said that he has a special "hacking tool" for getting the number of views. Azhaghu was too much eager to know that tool, hence Adarsh told Azhaghu that the hacking tool was nothing but maths! Indeed Adarsh had figured out the trick. Adarsh observed that a person who solves a problem gets to know about the number of solvers and the percentage of people who were able/not able to solve that problem.
So, if a certain problem shows that people have solved and of people were not able to solve the problem , So can you determine the number of views of the problem?
Details And Assumptions:
Assume that there is not such problem having and or .
Note that the solver's number includes the problem poster himself and you must not include him in the number of solvers.
" " denotes the nearest integer function. (Or you would get solvers in fractions!)
As a continued exercise, you can verify the formula for this problem after solving it.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let the number of views be V . Note that since we are not including the problem solver in solver's number , we will have the number of solvers as ( x − 1 ) From the given data , we can form an equation :
1 0 0 y × V = V − ( x − 1 ) ⇒ x − 1 = V − 1 0 0 y V ⇒ x − 1 = V ( 1 − 1 0 0 y ) ⇒ x − 1 = V ( 1 0 0 1 0 0 − y ) ⇒ V = 1 0 0 − y 1 0 0 ( x − 1 )
Since we want the nearest integer , we have :
V = [ 1 0 0 − y 1 0 0 ( x − 1 ) ]