4 solutions

  • 0
    @ 2026-7-13 15:18:09
    #include<bits/stdc++.h>
    using namespace std;
    int g[15][15]; 
    int main(){
    	int n,d;
    	cin>>n>>d;
    	for(int i=1;i<=n;i++){
    		for(int j=1;j<=d;j++){
    			cin>>g[i][j];
    		}
    	}
    	int res=0;
    	for(int i=1;i<=n;i++){
    		for(int j=i+1;j<=n;j++){
    			int sum=0;
    			for(int k=1;k<=d;k++){
    				sum+=(g[i][k]-g[j][k])*(g[i][k]-g[j][k]);
    			}
    			int k=sqrt(sum);
    			if(k*k==sum){
    				res++;
    			}
    		}
    	}
    	cout<<res;
    	return 0;
    }
    

    Information

    ID
    2136
    Time
    2000ms
    Memory
    1024MiB
    Difficulty
    3
    Tags
    (None)
    # Submissions
    59
    Accepted
    23
    Uploaded By