[POJ1082&POJ2348&POJ1067&POJ2505&POJ1960]简单博弈题总结

program poj1082;
const u:set of 0..20=[1,3,5,7,8,10,12];
var n,i,x,y,z:longint;
    f:array[1900..2002,1..12,1..31]of boolean;

function leap(x:longint):boolean;
begin
    if x mod 100=0 then
    begin
        if x mod 400=0 then exit(true);
    end else
    begin
        if x mod 4=0 then exit(true);
    end;
    exit(false);
end;

function exist(x,y,z:longint):boolean;
begin
    if y in u then
        begin
                if z<32 then exit(true);
        end else
    begin
        if y<>2 then
        begin
            if z>30 then exit(false) else exit(true);
        end else
        begin
            if (z<29)or(leap(x)and(z=29)) then exit(true);
        end;
    end;
    exit(false);
end;

function next_day(x,y,z:longint):boolean;
begin
    inc(z);
    if not exist(x,y,z) then
    begin
        inc(y);z:=1;
    end;
    if y>12 then
    begin
        inc(x);y:=1;
    end;
    exit(f[x,y,z]);
end;

function next_month(x,y,z:longint):boolean;
begin
    inc(y);
    if y>12 then
    begin
        inc(x);y:=1;
    end;
    if not exist(x,y,z) then exit(false);
    exit(f[x,y,z]);
end;

procedure solve;
var i,j,k:longint;
    flag:boolean;
begin
    fillchar(f,sizeof(f),false);
    for i:=2001 downto 1900 do
        for j:=12 downto 1 do
            for k:=31 downto 1 do if exist(i,j,k) then
            begin
                flag:=true;
                if next_day(i,j,k) then flag:=false;
                if next_month(i,j,k) then flag:=false;
                f[i,j,k]:=flag;
            end;
end;

begin
    assign(input,‘poj1082.in‘);reset(input);
    readln(n);
    solve;
        for i:=1 to n do
    begin
        readln(x,y,z);
        if f[x,y,z] then writeln(‘NO‘) else writeln(‘YES‘);
    end;
end.

program poj2960;
const maxn=10010;maxm=110;
var sizes,i,n,m,x,ans,j:longint;
    s:array[-1..maxm]of longint;
    w:array[-1..maxn]of longint;
    vis:array[-1..2*maxn,-1..maxm]of boolean;

procedure calc_SG;
var i,j:longint;
begin
    fillchar(vis,sizeof(vis),false);
    for i:=0 to maxn do
    begin
        for j:=0 to maxm do if not vis[i,j] then break;
        w[i]:=j;
        for j:=1 to sizes do vis[i+s[j],w[i]]:=true;
    end;
end;

begin
    //assign(input,‘poj2960.in‘);reset(input);
    //assign(output,‘poj2960.out‘);rewrite(output);
    read(sizes);
    while sizes<>0 do
    begin
        for i:=1 to sizes do read(s[i]);readln;
        calc_SG;
        readln(m);
        for i:=1 to m do
        begin
            ans:=0;
            read(n);
            for j:=1 to n do
            begin
                read(x);
                ans:=ans xor w[x];
            end;
                        if ans>0 then write(‘W‘) else write(‘L‘);
            readln;
        end;
                writeln;
        read(sizes);
    end;
end.

program poj2505;
var x:int64;

function solve(x:int64):boolean;
var k:int64;
begin
    k:=1;
    while true do 
    begin
        k:=k*9;
        if x<=k then exit(true);
        k:=k*2;
        if x<=k then exit(false);
    end;
end;

begin
    while not eof do 
    begin
        readln(x);
        if solve(x) then writeln(‘Stan wins.‘) else writeln(‘Ollie wins.‘);
    end;
end.

program poj2348;
var tem,x,y:int64;

function solve(x,y:int64):boolean;
begin
    if y=0 then exit(false);
    if x div y>=2 then exit(true);
    exit(not solve(y,x mod y));
end;

begin
    assign(input,‘poj2348.in‘);reset(input);
    readln(x,y);
    while (x<>0)or(y<>0) do
    begin
        if x<y then
        begin
            tem:=x;x:=y;y:=tem;
        end;
        if solve(x,y) then writeln(‘Stan wins‘)
        else writeln(‘Ollie wins‘);
                readln(x,y);
    end;
end.

program poj1067;
const INF=1000000000;
      num=(sqrt(5)-1)/2+1;
var x,y,tem:int64;

function find(x:int64):int64;
var L,R,mid,tem:int64;
begin
    L:=0;R:=INF;
    while L<=R do
    begin
        mid:=(L+R) >> 1;
        tem:=trunc(num*mid);
        if x=tem then exit(mid);
        if x<tem then R:=mid-1 else L:=mid+1;
    end;
    exit(-1);
end;

begin
    while not eof do
    begin
        readln(x,y);
        if x>y then
        begin
            tem:=x;x:=y;y:=tem;
        end;
        tem:=find(x);
        if (tem=-1)or(tem+x<>y) then writeln(1) else writeln(0);
    end;
end.