链接:https://ac.nowcoder.com/acm/contest/881/C
来源:牛客网
Bobo has a point A in the n n n dimension real space R n R_n Rn, whose coodinate is ( a 1 / m , a 2 / m , … , a n / m ) (a_1/m,a_2/m,…,a_n/m) (a1/m,a2/m,…,an/m) where a i a_i ai and m are both integers. He wants to find another point P = ( p 1 , p 2 , … , p n ) P=(p_1,p_2,…,p_n) P=(p1,p2,…,pn) meeting the following requirements.
- p 1 , p 2 , … , p n ∈ R p_1,p_2,…,p_n∈R p1,p2,…,pn∈R. That is, they are real numbers.
- p 1 , p 2 , … , p n ≥ 0 p_1,p_2,…,p_n≥0 p1,p2,…,pn≥0
- p 1 + p 2 + ⋯ + p n = 1 p_1+p_2+⋯+p_n=1 p1+p2+⋯+pn=1
- The (squared) Euclidean distance between P P P and A A A, which is ∥ A − P ∥ 2 = ∑ n i = ∑ ( a i / m − p i ) 2 ∥A−P∥^2=∑n_i=\sum(a_i/m−p_i)^2 ∥A−P∥