Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

#include<iostream>

int main()
{
    int m,n,i,j,k,f[310][310],a[310],x,num;
    long long re;
    re=0;
    scanf("%d%d",&m,&n);
    for (j=1;j<n;j++)
      for (k=j+1;k<=n;k++)
        f[j][k]=0;
    for (i=1;i<=m;i++)
    {
      num=0;
      for (j=1;j<=n;j++)
      {
         scanf("%d",&x);
         if (x)
         {
           for (k=1;k<=num;k++)
           {
               re+=f[a[k]][j];
               f[a[k]][j]++;
           }
           num++;
           a[num]=j;
         }
      }
    }
    printf("%lld\n",re);
//    system("pause");
    return 0;
}

Code mẫu của ladpro98

#include <bits/stdc++.h>

using namespace std;
int a[1111][333];
int cnt[333][333];
long long res;
int m, n;

int main()
{
    scanf("%d %d\n", &m, &n);
    int i, j, k;
    for(i=1; i<=m; i++) for(j=1; j<=n; j++) scanf("%d", &a[i][j]);
    for(k=1; k<=m; k++) for(i=1; i<n; i++)
    if (a[k][i] == 1) for(j=i+1; j<=n; j++)
    if (a[k][j] == 1) cnt[i][j]++;
    for(i=1; i<n; i++) for(j=i+1; j<=n; j++) res += (cnt[i][j] * (cnt[i][j] - 1)) >> 1;
    printf("%lld", res);
    return 0;
}

Code mẫu của RR

//Written by RR
{$R-,Q-}
{$Mode objfpc}
{$inline on}
uses math;
const
  FINP          =       '';
  FOUT          =       '';
  MAXM          =       1024;
  MAXN          =       333;

var
  f1,f2         :       text;
  m,n           :       longint;
  a             :       array[1..MAXM,1..MAXN] of longint;
  save          :       array[0..65536] of longint;

procedure openF;
    begin
      assign(f1,FINP); reset(f1);
      assign(f2,FOUT); rewrite(f2);
    end;
procedure closeF;
    begin
      close(f1);
      close(f2);
    end;

procedure inp;
    var
      i,j:longint;
    begin
      read(f1,m,n);
      for i:=1 to m do
      for j:=1 to n do
        read(f1,a[i,j]);
      while m and 15<>0 do inc(m);
    end;

procedure init;
    var
      k,i,bit,j:longint;
    begin
      for i:=0 to 65535 do
      for bit:=0 to 15 do
        if (i>>bit) and 1=1 then inc(save[i]);

      for i:=1 to m do
      if i and 15=1 then
        for j:=1 to n do
          begin
            for k:=i+1 to i+15 do
              a[i,j]:=a[i,j]<<1+a[k,j];
          end;
    end;

procedure solve;
    var
      u,v,i,x,count:longint;
      res:int64;
    begin
      res:=0;
      for u:=1 to n-1 do
      for v:=u+1 to n do
        begin
          count:=0;
          i:=1;
          while (i<=m) do
            begin
              x:=a[i,u] and a[i,v];
              inc(count,save[x]);
              inc(i,16);
            end;
          inc(res,((count-1)*count)>>1);
        end;
      writeln(f2,res);
    end;

begin
  openF;
  inp;
  init;
  solve;
  closeF;
end.

Code mẫu của hieult

#pragma comment(linker, "/STACK:16777216")

#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<iterator>
#include<iostream>
#include<cctype>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<list>
//#include<conio.h>
#define ep 0.000001
#define maxn 2002
#define base 1000000000
#define modunlo 111539786
#define oo 1000000002
#define TR(c, it) for(typeof((c).begin()) it=(c).begin(); it!=(c).end(); it++)
#define ull unsigned long long
#define fi first
#define se second

double const PI=4*atan(1);

using namespace std;

typedef pair<int, int> II;
typedef vector<int> VI;
typedef vector<II> VII;
typedef vector<VI> VVI;
typedef vector<VII> VVII;

typedef long long int64;

int f[1<<16], the, a[333][111], d[1011][311], t, so;
int n,m;

int main(){
   // freopen("input.in","r",stdin);
   // freopen("output.out","w",stdout);

    for(int i = 0; i < (1<<16); i ++){
        the = i;
        f[i] = 0;
        for(int j = 0; j < 16; j++){
            f[i] += (the & 1);
            the >>= 1;
        }
    }
    scanf("%d %d",&n,&m);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) scanf("%d",&d[i][j]);
    int run;
    for(int i = 1; i <= m; i++){
        so = 0;
        run = 0;
        for(int j = 1; j <= n; j++){
            so = so * 2 + d[j][i];
            if(j % 16 == 0 || j == n){
                a[i][++run] = so;
                so = 0;
            }
        }
    }

 //   printf("%d\n",run);

    long long kq = 0, tinh;
    for(int i = 1; i <= m; i++) for(int j = i + 1; j <= m; j++){
        tinh = 0;
        for(int k = 1; k <= run; k++) tinh += f[a[i][k]&a[j][k]];
       // printf("%d %d %d\n",i,j,a[i][1]&a[j][1]);
        kq += tinh * (tinh - 1) / 2;
    }
    printf("%lld",kq);

}

Code mẫu của ll931110

#include <iostream>
#define MAXN 301
using namespace std;

int a[MAXN],s[MAXN][MAXN],m,n;

int main()
{
    int i,j,k;
    long long res;

    //freopen("lqdrect.inp","r",stdin);
    //freopen("lqdrect.out","w",stdout);

    res = 0;
    scanf("%d%d", &m, &n);
    for (i = 1; i <= m; i++)
      {
           for (j = 1; j <= n; j++) scanf("%d", &a[j]);
           for (j = 1; j <= n; j++)
             if (a[j] == 1)
               {
                      for (k = 1; k <= j - 1; k++)
                        if (a[k] == 1)
                          {
                                 res += s[k][j];
                                 s[k][j]++;
                          }
               }
      }

    printf("%lld", res);
}

Code mẫu của khuc_tuan

#include <cstdio>
using namespace std;

int F[303][303];
int a[303];
int m, n;
long long res;

int main() {
    scanf("%d%d", &m, &n);
    for(int i=0;i<m;++i)
    {
        for(int j=0;j<n;++j) scanf("%d", &a[j]);
        for(int j=0;j<n;++j) if(a[j])
            for(int t=j+1;t<n;++t) if(a[t])
            {
                res += F[j][t];
                ++F[j][t];
            }
    }   
    printf("%lld\n", res);
    return 0;
}