A Multiplication Game

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2594 Accepted Submission(s): 1477

Problem Description

Stan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does his multiplication, then Ollie multiplies the number, then Stan and so on. Before a game starts, they draw an integer 1 < n < 4294967295 and the winner is who first reaches p >= n.

Input

Each line of input contains one integer number n.

Output

For each line of input output one line either

Stan wins.

Ollie wins.

assuming that both of them play perfectly.

Sample Input

162

17

34012226

Sample Output

      Stan wins. 

      Ollie wins. 

      Stan wins. 

      分析： 

      1~9（必胜）10~18(9*2)(必败) 19~162（18*9）（必胜）.......由此可看出规律 

      代码如下： 

#include<iostream>
using namespace std 
;
const
 __int64 Max 
=
 4294967295
 ;
__int64 a 
[
15
];
void Init 
()
{ 
    int i 
=
2
;
    int c 
=
1
;
    a 
[
1
]=
1
;
    for
(i 
=
2
;;i 
++)
    { 
        if
(c 
)
        { 
            a 
[i 
]=a 
[i 
-
1
]*
9
;
            if
(a 
[i 
]> Max 
)
                break
;
        }
        else
        { 
            a 
[i 
]=a 
[i 
-
1
]*
2
;
            if
(a 
[i 
]> Max 
)
                break
;
        }
        c 
=!c 
;
    }
}
int
 main
()
{ 
    __int64 n 
;
    int i 
;
    Init 
();
    while
(~scanf 
(
"%I64d"
,&n 
))
    { 
        for
(i 
=
2
;i 
<
17
;i 
++)
        { 
            if
(i 
%
2
==
0
)
            { 
                if
(n 
<=a 
[i 
])
                { 
                    printf 
(
"Stan wins.\n"
);
                    break
;
                }
            }
            else
            { 
                if
(n 
<=a 
[i 
])
                { 
                    printf 
(
"Ollie wins.\n"
);
                    break
;
                }
            }
        }
    }
    return
 0
;
}

转载于:https://www.cnblogs.com/xiong-/archive/2013/05/19/3087604.html

你可能感兴趣的文章