# SkyWT

#### 我们的征途是星辰大海

💬 博客评论 IP 错乱的问题已修复。最近更新：博客全面启用 PJAX 无刷新（221005）。
📧 现在可以使用邮箱订阅本博客。欢迎订阅！

## Description

For every pair of triplets, $T_a = (I_a, J_a, K_a)$ and $T_b = (I_b, J_b, K_b)$, we define the difference value between $T_a$ and $T_b$ as follows:

$$D(T_a, T_b) = \max (I_a − I_b, J_a − J_b, K_a − K_b) − \min (I_a − I_b, J_a − J_b, K_a − K_b)$$

Now you are given $N$ triplets, could you write a program to calculate the sum of the difference values between every unordered pair of triplets?

More...

More...

## Problem Description

YJJ is a salesman who has traveled through western country. YJJ is always on journey. Either is he at the destination, or on the way to destination.
One day, he is going to travel from city $A$ to southeastern city $B$. Let us assume that A is $(0,0)$ on the rectangle map and $B (10^9,10^9)$. YJJ is so busy so he never turn back or go twice the same way, he will only move to east, south or southeast, which means, if YJJ is at $(x,y)$ now $(0\leqslant x\leqslant 10^9,0\leqslant y\leqslant 10^9)$, he will only forward to $(x+1,y)$, $(x,y+1)$ or $(x+1,y+1)$.

More...

More...

Topcoder Single Round Match 634 Div 2 T3 SpecialStrings 题解

More...

Topcoder Single Round Match 635 Div2 T3 LonglongestPathTree 题解

More...

More...

Topcoder Single Round Match 616 Div 2 T3 题解

More...

Topcoder Single Round Match 640 Div 1 T1 ChristmasTreeDecoration 题解

More...