Topic

SimpleMath

MilosRadic2010-05-27 19:12:25

can someone tell me what are the limits for T cause i really doubt that this is solvable in pascal...for huge t u cannot even read in time...0.1 sec the last test case wont pass no matter what i do.
what is the guess for the number we should write
imo its sqrt(2*n)

MilosRadic2010-05-30 15:38:39

someone???

Al3kSaNdaR2010-05-30 15:58:40

There is some kind of an formula for this task ( but this isn't the way I did it ) :

ReadLn ( X );

WriteLn ( Succ ( Trunc ( Sqrt ( Succ ( 8 * X ) ) / 2 - 0.5 ) ) );

MilosRadic2010-05-30 16:25:10

how did u do it my gues is sqrt(2*n) but still TLE on last...

Al3kSaNdaR2010-05-30 16:31:10

My solution :

Create array 1 3 6 10 15 21 . . .

Than binary search for number .

MilosRadic2010-05-30 16:34:02

hmmm well when u do sqrt(2*n) then it is either that or that minus 1 or 2 so only 2-3 checks for every n and that binary search would take longer but idk maybe sqrt takes too long?or perhaps cant solve it cause of pascal?

Al3kSaNdaR2010-05-30 16:41:22

Y Pascal's Sqrt is slow IMHO .

MilosRadic2010-05-30 16:42:15

:((((
MAKES ME WANNA LEARN C++:D

Al3kSaNdaR2010-05-30 16:42:53

LEARN IT, JOIN THE DARK SIDE YOUNG SKYWALKER . xDDDD

MilosRadic2010-05-30 16:43:20

Dgleich2010-06-01 11:49:46

The answer isn't always very near sqrt(2N)...

MilosRadic2010-06-01 12:48:57

well the thing is the sqrt operation isnt even done in time...