zoukankan      html  css  js  c++  java
  • poj2348 Euclid's Game

    Description

    Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7): 
             25 7
    
    11 7
    4 7
    4 3
    1 3
    1 0

    an Stan wins.

    Input

    The input consists of a number of lines. Each line contains two positive integers giving the starting two numbers of the game. Stan always starts.

    Output

    For each line of input, output one line saying either Stan wins or Ollie wins assuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.

    Sample Input

    34 12
    15 24
    0 0
    

    Sample Output

    Stan wins
    Ollie wins
    

    Source

    Waterloo local 2002.09.28
     
     
     
    这题我是看书上题解的。

    要用int64(pascal)或longlong(c++),有点坑。 

     1 program rrr(input,output);
     2 var
     3   a,b,t:int64;
     4   f:boolean;
     5 begin
     6    assign(input,'r.in');assign(output,'r.out');reset(input);rewrite(output);
     7    readln(a,b);
     8    while (a<>0) and (b<>0) do
     9       begin
    10          f:=true;
    11          while true do
    12             begin
    13                if a>b then begin t:=a;a:=b;b:=t; end;
    14                if b mod a=0 then break;
    15                if b>a+a then break;
    16                f:=not f;b:=b-a;
    17             end;
    18          if f then writeln('Stan wins') else writeln('Ollie wins');
    19          readln(a,b);
    20       end;
    21    close(input);close(output);
    22 end.
  • 相关阅读:
    加工零件(Dijkstra)
    尼克的任务(DP)
    挖地雷(记忆化搜索)
    滑雪(DP,记忆化搜索)
    子串和子序列(DP)
    八皇后(DFS)
    打印feign报错日志
    restTemplate 踩坑
    共享全局对象
    获取当月多少天
  • 原文地址:https://www.cnblogs.com/Currier/p/6641735.html
Copyright © 2011-2022 走看看