Cod sursa(job #3162384)
| Utilizator | Data | 29 octombrie 2023 09:04:02 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fold.in");
ofstream fout("fold.out");
int main()
{
int n,m;
fin>>n>>m;
int mat[251][2001];
long long ans=0;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fin>>mat[i][j];
for(int i=1; i<=n; i++)
for(int j=i+1;j<=n;j++){
int nr=0;
for(int q=1;q<=m;q++)
nr+=(mat[i][q]&mat[j][q]);
ans+=(1LL*(nr*(nr-1)/2));
}
fout<<ans;
return 0;
}
