A929.Cow Gymnastics--Bronze

入门

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

In order to improve their physical fitness, the cows have taken up gymnastics!
Farmer John designates his favorite cow Bessie to coach the NN other cows and
to assess their progress as they learn various gymnastic skills.
In each of KK practice sessions (1K101 \leq K \leq 10), Bessie ranks the NN
cows according to their performance (1N201 \leq N \leq 20). Afterward, she is
curious about the consistency in these rankings. A pair of two distinct cows
is consistent if one cow did better than the other one in every practice
session.
Help Bessie compute the total number of consistent pairs.

输入格式

The first line of the input file contains two positive integers KK and NN.
The next KK lines will each contain the integers 1N1 \ldots N in some order,
indicating the rankings of the cows (cows are identified by the numbers 1N1 \ldots N). If AA appears before BB in one of these lines, that means cow
AA did better than cow BB.

输出格式

Output, on a single line, the number of consistent pairs.

输入输出样例

  • 输入#1

    3 4
    4 1 2 3
    4 1 3 2
    4 2 1 3
    

    输出#1

    4
    

说明/提示

The consistent pairs of cows are (1,4)(1,4), (2,4)(2,4), (3,4)(3,4), and (1,3)(1,3).

首页