I was solving this problem during 5 days
Next texts were helphfull
0 0.083334  4
30 2 60
330 4 60
90 8 60
60 10 60
ans
6.99999
1
2
4
3

0 0.1 3
0 2 60
0 3 70
0 6 80

ans
0.00000
1
2
3

0 0.083334  3
30 2 60
90 8 60
60 10 60
ans
2.9999
1
3
2

0 0.0833334 2
210 6 60
150 20 60
ans
6.9999
1
2

0 0.0833334 4
330 2 60
150 8 60
30 4 60
210 20 60
ans
8.99999
1
3
2
4

0 0.083334 2
90 10 60
330 10 60
ans:
4.999
2
1

Most of your tests are incorrect)) "All numbers contain at most three fractional digits". But they are surely useful.

I can't say this problem is so hard. I had only some problems with accuracy. These tests may help:

0 0.010 3
359.999 167.667 100.000
180 84.334 100.000
0.001 1.001 100.000
ans
100.000
3
2
1

0 0.010 3
359.999 167.666 100.000
180 84.334 100.000
0.001 1.001 100.000
ans
Impossible

P. S. Can you give me some hints on 1672?

Edited by author 12.02.2009 22:15

If you can't see this problem as easy
all hints are unhelphull.
We are, old mathematitians have habbit
to use cost function, restrictions
and sequence of points set under refimement procedure
to find optimization result.