POJ 2304

 #include<iostream>//  cheng da cai zi 11. 18  解锁问题
 using namespace std;
 #define f 360
 int main()
 {
     int b;
     int a1;
     int a2;
     int a3;
     int sum=;
     int sum1=*;
     while()
     {
     sum=;
     sum1=*;
     cin>>b;
     cin>>a1;
     cin>>a2;
     cin>>a3;
     if(b==&&a1==&&a2==&&a3==)
         break;
     ///////////////顺时针
         if(b>=&&b<a1)
         sum+=-a1*+b*;
     else if(b>a1&&b<)
         sum+=b*-a1*;
     sum1+=sum;
     //cout<<sum<<"--------------"<<endl;
     ////////////////逆时针
     sum=;
     if(a1>=&&a1<a2)
         sum+=a2*-a1*;
     else if(a1>a2&&a1<)
         sum+=-a1*+a2*;
     sum1+=sum;
         //cout<<sum<<"--------------"<<endl;
     ///////////////////顺时针
     sum=;
     if(a2>=&&a2<a3)
         sum+=-a3*+a2*;
     else if(a2>a3&&a2<)
         sum+=(a2-a3)*;
     sum1+=sum;
         //cout<<sum<<"--------------"<<endl;
     cout<<sum1<<endl;
     }
     return ;
 }