AcWing 1459. 奶牛体操(Java)
原题链接
简单
作者:
benjam1n
,
2022-04-01 23:20:02
,
所有人可见
,
阅读 206
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int K = in.nextInt();int N = in.nextInt();
int[][] f = new int[N+1][N+1];
for(int i=0;i<K;i++) {
int[] t = new int[N+1];
for(int j=1;j<=N;j++)
t[j]=in.nextInt();
for(int m = 1;m+1<=N;m++)
for(int n = m+1;n<=N;n++)
f[t[m]][t[n]]=1;
}
int res=0;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(f[i][j]==1&&f[j][i]!=1)
res++;
System.out.println(res);
}
}