ZR 10.1 National Day Training

T1

Gives a Fibonacci number, the definition of \ (F_n = \ sum_ {I} ^ {n = 0} F [I] \) , requires the \ (F_i \) before and n terms.

years

I:! Distributive law of multiplication + prefix and
\ (70> 20 \)

You know why?

Not because prefixes and modulo is the world's most ** error
\ (Dalao \) :

T2

Given a tree without roots and some paths, ask at the root of all manner of selection and tree split in the chain, at least cover these paths many times lighter side.
I: enumeration root + \ (LCA \) + tree difference! \ (-> 45pts \) .
the problem is on the enumeration root.

In other root method, and then after school.

T3

Give up (Konjac crying)