Clock

Question

问题描述 :

Books

There is only one Big Clock in the Alibaba’s headquarters on Mars. Since it is on Mars, the Clock is different as it was on Earth.
There are A hours per day and B minutes per hour. The Clock has two hands, the hour hand and the minute hand. The hour hand travels 360 degrees per day and the minute hand travels 360 degrees per hour. Both hands travel consecutively.
But for some reason, the Clock is not very steady. One day the Clock drops off the wall, but fortunately, it is still working. So they plans to put it back onto the wall. But they soon found a problem: it’s the only clock they have, so they don’t know the current time now. Clock only shows the relative position between the two hands, but doesn’t show how to place it (as there are no marks on it), so it can be rotated and represent several different times.
They want your help to determine how many different times the clock may represent.
输入:

The input consists several testcases.
Every test case only contains one line with two integers A, B (1 <= A,B <= 109) and a real number θ (0 < θ < 2 π), means that there are A hours per day and B minutes per hour, and the minute hand is θ rad ahead of the hour hand)
Input ends with one line containing “0 0 0”.
输出:

The input consists several testcases.
Every test case only contains one line with two integers A, B (1 <= A,B <= 109) and a real number θ (0 < θ < 2 π), means that there are A hours per day and B minutes per hour, and the minute hand is θ rad ahead of the hour hand)
Input ends with one line containing “0 0 0”.
样例输入:

1 1 1.57
0 0 0
样例输出:

0

Answer 1

#include
#include
#include
#include
#include
#include
#include
using namespace std;
int a,b;
double c,d,t,pi;
bool flag;

int main()
{
pi = 3.1416926536;
while(scanf("%d%d%lf",&a,&b,&c)!=EOF && (a!=0 || b !=0 || fabs(c)>0.0000001))
{
printf("%d\n",a - 1);
}
return 0;
}