Diferente pentru problema/sumtree intre reviziile #23 si #24

Nu exista diferente intre titluri.

Diferente intre continut:

== include(page="template/taskheader" task_id="sumtree") ==
You are given a tree with $N$ nodes. Each node has values assigned to it, <tex> value_i </tex>. You must calculate the sum cost of every pair nodes <tex>(u, v)</tex>, where <tex>gcd(value[u], value[v]) > 1</tex> and $u$ &ne; $v$. For a pair of nodes <tex>(u, v)<tex>, we define the cost of that path to be the sum of value of all nodes that lie inside the <tex>(u, v)</tex> path.
You are given a tree with $N$ nodes. Each node has values assigned to it, <tex> value_i </tex>. You must calculate the sum cost of every pair nodes <tex>(u, v)</tex>, where <tex>gcd(value_u, value_v) > 1</tex> and $u$ &ne; $v$. For a pair of nodes <tex>(u, v)<tex>, we define the cost of that path to be the sum of value of all nodes that lie inside the <tex>(u, v)</tex> path.
h2. Date de intrare

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.