E-From AtCoder_2025牛客国庆集训派对day1

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

You have an $n \times n$ grid. Each cell contains an integer. The number at the $i$ -th row and $j$ -th column has initial value $a_{i, j}(1\leq i, j \leq n)$ .
In one operation you can choose a cell $(i, j)$ and an integer $x$ such that $|x| \leq 10^9$ and do the following:

Add $x$ to each number in the $i$ -th row. Then, subtract $x$ from each number in the $j$ -th column.

Determine whether you can make all numbers non-negative within $1000$ operations. If so, construct a solution.

输入描述:

The first line contains a single integer .

The next  lines each contains  integers. The -th integer on the -th line is .

输出描述:

If your goal cannot be achieved, print one integer  in a line.

Otherwise print integer  in the first line, indicating the number of operations. Then print  lines. Each line contains three integers  separated by a single space, indicating one operation. You must make sure .