2019 - 题目 - QOJ.ac

#3758. 2019

统计

Bobo 有一颗 $n$ 个点的树，点的编号是 $1, 2, \dots, n$. 树有 $(n - 1)$ 条边，第 $i$ 条边的端点是 $a_i$ 和 $b_i$，权值是 $c_i$. 求满足 $u < v$ 的 $(u, v)$ 数量，满足点 $u$ 到点 $v$ 路径上的权值和是 $2019$ 的倍数。

输入格式

输入文件包含多组数据，请处理到文件结束。

每组数据的第一行包含一个整数 $n$.

接下来 $(n - 1)$ 行，其中第 $i$ 行包含三个整数 $a_i$, $b_i$ 和 $c_i$.

$n \leq 2 \times 10^4$
$1 \leq a_i, b_i \leq n$
$0 \leq c_i < 2019$
$n$ 的总和不超过 $10^5$.

输出格式

对于每组数据，输出一个整数，表示所求的值。

样例输入

样例输出

2
6
0

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.