QOJ.ac

QOJ

Limite de temps : 1.0 s Limite de mémoire : 64 MB Points totaux : 100 Hackable ✓

#12062. 美好时光

Statistiques

给定两个日期 $y/m/d$ 和 $yy/mm/dd$,其中一个是第一个“好日子”,另一个是最后一个“好日子”。 这两个日期之间的所有日子(包含这两个日期)也都是好日子,其余日子则不是。 你需要计算好日子的总数。

输入

第一行包含一个整数 $T$ ($1 \le T \le 10000$),表示测试用例的数量。 每个测试用例包含六个整数 $y\ m\ d\ yy\ mm\ dd$ ($1 \le y, yy \le 5000$)。

输出

输出好日子的数量。

样例

输入格式 1

1
2016 11 8 2016 11 11

输出格式 1

4

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.