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=0;
int sum1=360*3;
while(1)
{
sum=0;
sum1=360*3;
cin>>b;
cin>>a1;
cin>>a2;
cin>>a3;
if(b==0&&a1==0&&a2==0&&a3==0)
break;
///////////////顺时针
if(b>=0&&b<a1)
sum+=360-a1*9+b*9;
else if(b>a1&&b<40)
sum+=b*9-a1*9;
sum1+=sum;
//cout<<sum<<"--------------"<<endl;
////////////////逆时针
sum=0;
if(a1>=0&&a1<a2)
sum+=a2*9-a1*9;
else if(a1>a2&&a1<40)
sum+=360-a1*9+a2*9;
sum1+=sum;
//cout<<sum<<"--------------"<<endl;
///////////////////顺时针
sum=0;
if(a2>=0&&a2<a3)
sum+=360-a3*9+a2*9;
else if(a2>a3&&a2<40)
sum+=(a2-a3)*9;
sum1+=sum;
//cout<<sum<<"--------------"<<endl;
cout<<sum1<<endl;
}
return 0;
}