forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathE.cpp
More file actions
77 lines (65 loc) · 1.99 KB
/
E.cpp
File metadata and controls
77 lines (65 loc) · 1.99 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
const int MN = 111;
struct Point {
double x, y, z;
Point() {}
Point(double x, double y, double z) : x(x), y(y), z(z) {}
Point operator - (const Point& a) const {
return Point(x-a.x, y-a.y, z-a.z);
}
Point operator + (const Point& a) const {
return Point(x+a.x, y+a.y, z+a.z);
}
Point operator * (const double& k) const {
return Point(x*k, y*k, z*k);
}
Point operator / (const double& k) const {
return Point(x/k, y/k, z/k);
}
double len() {
return sqrt(x*x + y*y + z*z);
}
void read() {
cin >> x >> y >> z;
}
void print() {
cout << x << ' ' << y << ' ' << z << endl;
}
} a[MN];
int main() {
ios :: sync_with_stdio(false);
int n;
cout << (fixed) << setprecision(9);
while (cin >> n) {
FOR(i,1,n) a[i].read();
Point sum = Point(0, 0, 0);
FOR(i,1,n) sum = sum + a[i];
sum = sum / n;
// sum.print();
double rate = 20000;
REP(turn,10000) {
Point largest = Point(0, 0, 0);
FOR(i,1,n) {
Point cur = a[i] - sum;
if (cur.len() > largest.len()) largest = cur;
}
if (largest.len() > rate) {
largest = largest * (rate / largest.len());
}
sum = sum + largest;
rate *= 0.997;
}
sum.print();
}
}