提交时间:2022-07-13 11:52:47

运行 ID: 51560

#include<bits/stdc++.h> #define ll long long using namespace std; const int N=510; inline ll read(){ ll x=0,f=1,c=getchar(); while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); return x*f; } int n,k,mp[N][N]; int main(){ n=read(),k=read(); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) mp[i][j]=read(); if(k==1){ printf("%d",(n-1)*(n-2)>>1); return 0; } }