hdu 1848 博弈之SG函数的使用

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <stdlib.h>

int f[1005],sg[1005],hash[1005];

void
GetSg(int
n)

{

      int
i,j;

      memset(sg,0,sizeof(sg));

      for(i=1;i<=n;i++)

      {

            memset(hash,0,sizeof(hash));

            for(j=1;f[j]<=i;j++)

            {

                 hash[sg[i-f[j]]]=1;

            }

            for(j=0;j<=n;j++)

            {

                 if(hash[j]==0)

                 {

                     sg[i]=j;

                     break;

                 }

            }//printf("%d",sg[n]);

      }

}

int
main()

{

     int
i,j,m,n,p;

     f[0]=1;f[1]=1;

     for(i=2;i<=16;i++)

     {

          f[i]=f[i-2]+f[i-1];

     }

     GetSg(1001);

     while(scanf("%d%d%d",&m,&n,&p)!=EOF&&m||n||p)

     {

             if((sg[m]^sg[n]^sg[p]))

             {

                  printf("Fibo\n");

             }

             else

             {

                  printf("Nacci\n");

             }

     }

     return
0;

}