OJ Board

You cannot solve this problem by making an exaustive search. For 32 bit states that would mean searching all (2^32 - 1) different states :o! That uses to much time.
The idea is to look at the automaton, look at the state and somehow compute if there is any possible predecessor state. If there isn ...

Thanks. Already found out my error. And found out a bug to. Its posted on another topic though.


Jo

While trying to understand why my code didn't work (I kept getting WA) i discovered something intersting.

Here is the cyle for number 704511 :

704511
2113534
1056767
3170302
1585151
4755454
2377727
7133182
3566591
10699774
5349887
16049662
8024831
24074494
12037247
36111742 ...

I don't understand why my code doesn't work. :cry:
I keep getting WA. Can you see anything wrong? :o

[c]
#include <stdio.h>
#include <string.h>

#define TABLE_SIZE 2500000

unsigned short s_length[TABLE_SIZE];

unsigned short cycleLength(unsigned long n) {
unsigned short length = (n > TABLE_SIZE ...