220 DIV2 A. Inna and Pink Pony

 1 #include<cstdio>
 2 #include<cmath>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<queue>
 6 #include<limits.h>
 7 using namespace std;
 8 int n,m,i,j,a,b;
 9 
10 int check(int x,int y)
11 {
12     int fx,fy;
13 
14     if(x==i && y==j)
15     return 0;
16     if(i+a>n&&i-a<1 || j+b>m&&j-b<1)//边界
17     return INT_MAX;
18     fx=abs(x-i);
19     fy=abs(y-j);
20     if(fx%a!=0 || fy%b!=0)//同为整数步
21     return INT_MAX;
22     fx=fx/a;//得到步数
23     fy=fy/b;//得到步数
24     int fz;
25     fz=abs(fx-fy);
26     if(fz%2==0)//同奇同偶
27     {
28         fz=max(fx,fy);
29         return fz;
30     }
31     else
32     return INT_MAX;
33 }
34 int main()
35 {
36     while(~scanf("%d%d%d%d%d%d",&n,&m,&i,&j,&a,&b))
37     {
38         int count=INT_MAX;
39         count=min(check(1,1),check(1,m));
40         count=min(count,check(n,1));
41         count=min(count,check(n,m));
42         if(count==INT_MAX)
43         printf("Poor Inna and pony!\n");
44         else
45         printf("%d\n",count);
46     }
47     return 0;
48 }