A convex polyhedron $Q$ has vertices $V_1,V_2,\ldots,V_n$, and $100$ edges. The polyhedron is cut by planes $P_1,P_2,\ldots,P_n$ in such a way that plane $P_k$ cuts only those edges that meet at vertex $V_k$. In addition, no two planes intersect inside or on $Q$. The cuts produce $n$ pyramids and a new polyhedron $R$. How many edges does $R$ have?
一个凸多面体 $Q$ 有顶点 $V_1,V_2,\ldots,V_n$,并且有 $100$ 条棱。用平面 $P_1,P_2,\ldots,P_n$ 切割该多面体,使得平面 $P_k$ 只切割那些在顶点 $V_k$ 处相交的棱。此外,任意两平面都不在 $Q$ 的内部或表面相交。切割产生 $n$ 个棱锥和一个新的多面体 $R$。求 $R$ 有多少条棱。