Cudan_niz2
Lovro find a sequence.But this time a algorithm he must use is more difficulty
than last time. He has a N number. 1 to N.This is the rule he must hold-up.
On each number he must add his log10 function and add square root of four.
( n + log10(n) + sqrt(sqrt(n)) )
Lovro wants to know on which place is number K i new sequence. If the number K doesn't exist write just -1.
InputIn first line you have two numbers N and K.
N<=1000000,K<=1000000.
N<=1000000,K<=1000000.
OutputYou must write a place a number K in new sequence
Input
8 8Output
6Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.