AC代码:
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<math.h>
using namespace std;
struct stu
{
double x, y;
};
bool cmp(const stu &a, const stu &b)
{
if (atan2(a.y,a.x)<atan2(b.y,b.x))return true;
else return false;
}
int main()
{
int n;
while (cin >> n&&n >= 0)
{
if (n == 0)continue;
stu s[105];
for (int i = 0; i < n; i++)
{
cin >> s[i].x >> s[i].y;
}
sort(s, s + n, cmp);
for (int i = 0; i < n; i++)
{
if (i > 0)cout << " ";
printf("%.1lf %.1lf" , s[i].x, s[i].y );
}
cout << endl;
}
return 0;
}