11549 - Calculator Conundrum

[Ron]

Give me hints please..!!

[pvncad]

use cycle detection algorithm like http://en.wikipedia.org/wiki/Floyd_cycl ... _algorithm

[Ron]

I am getting TLE using Cycle detection algorithm...

Code: Select all

got AC

[Abednego]

use cycle detection algorithm

Or you could just remember all of the numbers you've seen so far and stop as soon as you reach a previously seen number. That's what I did.

[Ron]

Abednego wrote :
Or you could just remember all of the numbers you've seen so far and stop as soon as you reach a previously seen number. That's what I did.

How did you store previous numbers after find new number by given function ??

[Abednego]

Code: Select all

set<int> seen;

You could also set up a huge bit vector to make updates O(1), as long as you only use one bit per number, but it wasn't necessary.

[Ron]

Still, i am getting TLE

Code: Select all

finally .. AC

The problem was in my function in which i was taking so much time to find next number.

[calicratis19]

i have got AC in this prob. but it took huge time 4.150 sec.

can any one pls explain the floyd's cycle finding algo pls ?? i have read abt it in wiki but couldnt understand .

[Jehad Uddin]

u can use map,to find the no that was found before,
u can declare map lyk this,
#include<map>
......
map<int,int>map_name;
.....

[lionking]

could someone give me some IO to test?

I got WA...

[saiful_sust]

Hi try this case:

input:

Code: Select all

3
45 3
3 45
5 12

output:

Code: Select all

9
992
99162