CF1389E.Calendar Ambiguity

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Berland year consists of $m$ months with $d$ days each. Months are numbered from $1$ to $m$ . Berland week consists of $w$ days. The first day of the year is also the first day of the week. Note that the last week of the year might be shorter than $w$ days.

A pair $(x, y)$ such that $x < y$ is ambiguous if day $x$ of month $y$ is the same day of the week as day $y$ of month $x$ .

Count the number of ambiguous pairs.

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 1000$ ) — the number of testcases.

Each of the next $t$ lines contains three integers $m$ , $d$ and $w$ ( $1 \le m, d, w \le 10^9$ ) — the number of months in a year, the number of days in a month and the number of days in a week.

输出格式

Print $t$ integers — for each testcase output the number of pairs $(x, y)$ such that $x < y$ and day $x$ of month $y$ is the same day of the week as day $y$ of month $x$ .

输入输出样例

输入#1

5
6 7 4
10 7 12
12 30 7
1 1 1
3247834 10298779 625324

输出#1

说明/提示

Here are the pairs for the first test case:

首页