hdu1517A Multiplication Game

来源：互联网发布：中国移动网络加速器编辑：程序博客网时间：2024/06/06 16:43

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.

解题思路：

很有意思的一道博弈题目，也不是很难，关键就看你能不能想到，直接进行P/N分析，我们所有的[n/9,n-1]为必胜点；那么所有的[n/9/2,n/9-1]为必败点:

#include<stdio.h>#include<math.h>int main(){   int flag;   int n;   while(scanf("%d",&n)!=EOF){      flag=-1;      while(n>1){         if(flag&2){           n=ceil(n*1.0/9);         }else{           n=ceil(n*1.0/2);         }         flag*=-1;      }      if(flag&2)        puts("Ollie wins.");      else         puts("Stan wins.");   }}

ceil()是向上取整的函数；

0 0