Pagini recente » Cod sursa (job #598465) | Cod sursa (job #1794604) | Cod sursa (job #2553338) | Cod sursa (job #2479967) | Cod sursa (job #2099218)
#include <fstream>
using namespace std;
ifstream fin("fold.in");
ofstream fout("fold.out");
bool v[ 255 ][ 2005 ];
int n, m, i, j, t, k;
long long s = 0;
int main () {
fin>>n>>m;
for (i=1; i<=n; i++){
for (j=1; j<=m; j++ ){
fin>>v[i][j];
}
}
for (i=1; i<n; i++){
for (j=i+1; j<=m; j++ ){
k = 0;
for ( t = 1; t <= m; t++ ){
k+=(v[i][t] == 1 && v[j][t]==1);
}
s+=(long long)k*( k - 1 )/ 2;
}
}
fout<<s;
return 0;
}