cf A. Inna and Pink Pony(思维题)

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int INF=(1<<28);
int n,m,x,y,a,b;

int ok(int x1,int y1)
{
if(x1<0) x1=-x1;
if(y1<0) y1=-y1;
if(x1%a==0&&y1%b==0)//能恰好 到达边界
{
if((x1/a-y1/b)%2==0)//而且两个的差为偶数。。
{
if(x1/a>y1/b)
return x1/a;
else
return y1/b;
}
}
return INF;
}
int main()
{
int d[10];
while(cin>>n>>m>>x>>y>>a>>b)
{
if((x==1&&y==m)||(x==n&&y==1)||(x==n&&y==m)||(x==1&&y==1))
{
cout<<"0"<<endl;
continue;
}
if(a>=n||b>=m)//有可能一步就会越界。。
{
cout<<"Poor Inna and pony!"<<endl;
continue;
}
d[0]=ok(x-1,y-m);
d[1]=ok(x-n,y-1);
d[2]=ok(x-n,y-m);
d[3]=ok(x-1,y-1);
sort(d,d+4);
if(d[0]==INF)
cout<<"Poor Inna and pony!"<<endl;
else
cout<<d[0]<<endl;
}
return 0;
}