【博弈】【找规律】HDOJ1517

题目

A Multiplication Game

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. or Ollie wins.

assuming that both of them play perfectly.

Sample Input
162
17
34012226

Sample Output
Stan wins.
Ollie wins.
Stan wins.

思路

两个人足够聪明，18就是不可避免的
当数小于等于9是Stan win，也就是必败态
当数在9到18时Ollie win 因为乘什么都大于这个数，必胜态

#include<iostream>
#include<cmath>
#include<string>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
   double n;
  while(scanf("%lf",&n)!=EOF)             //别用(cin>>n,n),此时会进入Output Limit Exceeded 
  {
      while(n>18)n=n/18;
       if(n<=9)
       {
          printf("Stan wins.\n");
       }
       else
        printf("Ollie wins.\n");
  }
       
    return 0;
}