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>
#include<algorithm>
#include<cmath>
#define fr(a,b,c) for (a=b;a<=c;a++)
#define frr(a,b,c) for (a=b;a>=c;a--)
using namespace std;
int m,n,x,r,y,s,i,j;
long long re;

int main()
{
    cin >> m >> n >> s;
    s*=2;
    fr(x,1,m)
     fr(y,1,n)
     {
        r=0;
        if (x*y==s) r=(x+y)*2;
        else
        {
            fr(i,1,x)
            {
               j=i*y-s;
               if (j%x==0) j/=x;
               if (j<0 || j>y) continue;
               int u=x*y-i*j-(x-i)*j*2-(y-j)*(x-i);
               if (u==s) r+=4;
            }           
        }
        fr(i,1,x-1)
        {
           int u=x*y*2-i*y-s;
           u+=i*y-x*y;
           if (u%i==0)
           {
              j=u/i;
              if (j>0 && j<y) r+=4;
           }
        }
        re+=r*(m-x+1)*(n-y+1);
     }
    cout << re << endl;
    return 0;
}

Code mẫu của RR

{$MODE OBJFPC}

uses math;
const
  FINP          =       '';
  FOUT          =       '';
  MAXN          =       250;

var
  f1,f2         :       text;
  x,y,s         :       longint;
  res           :       int64;
  nhan          :       array[-250..250,-250..250] 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 solve;
    var
      xa,ya,xb,yb,lx,ly:longint;
    begin
      for xa:=-x to x do
      for ya:=1 to y do
        begin
          for yb:=1 to y do
            begin
              if (nhan[xa,yb]-s) mod ya<>0 then continue;
              xb:=(-s+nhan[xa,yb]) div ya;

              lx:=max(max(0,xa),xb)-min(min(0,xa),xb);
              ly:=max(ya,yb);
              if (lx<=x) then
                  res:=res+nhan[x-lx+1,y-ly+1];
            end;
        end;
      writeln(f2,res);
    end;

procedure solve0;
    var
      xa,ya,xb,yb,lx,ly:longint;
    begin
      ya:=0;
      for xa:=1 to x do
        begin
          if s mod xa<>0 then continue;
          yb:=s div xa;

          for xb:=-x to x do
            begin
              lx:=max(max(xa,xb),0)-min(min(xa,xb),0);
              ly:=max(max(ya,yb),0)-min(min(ya,yb),0);
              if (lx<=x) and (ly<=y) then
                res:=res+nhan[x-lx+1,y-ly+1];
            end;
        end;
    end;

procedure init;
    var
      i,j:longint;
    begin
      for i:=-250 to 250 do
      for j:=-250 to 250 do
        nhan[i,j]:=i*j;
    end;

begin
  openF;
  read(f1,x,y);
  if x<y then begin s:=x; x:=y; y:=s; end;
  read(f1,s); s:=s*2;

  init;
  solve0;
  solve;
  closeF;
end.

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef long double ld;
//typedef double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(__typeof(n) i = 0; i < (n); ++i)
#define Repd(i,n) for(__typeof(n) i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(__typeof(b) i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(__typeof(a) i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))
#define nl puts("")
#define sp printf(" ")
#define ok puts("ok")
//#include <conio.h>

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> void db(T a, int p = -1) { if (p >= 0) cout << fixed << setprecision(p); cout << a << " "; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> struct Triple { T x, y, z; Triple() {} Triple(T _x, T _y, T _z) : x(_x), y(_y), z(_z) {} };
template<class T> Triple<T> euclid(T a, T b) { if (b == 0) return Triple<T>(1, 0, a); Triple<T> r = euclid(b, a % b); return Triple<T>(r.y, r.x - a / b * r.y, r.z); }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }
const int bfsz = 1 << 16; char bf[bfsz + 5]; int rsz = 0;int ptr = 0;
char gc() { if (rsz <= 0) { ptr = 0; rsz = fread(bf, 1, bfsz, stdin); if (rsz <= 0) return EOF; } --rsz; return bf[ptr++]; }
void ga(char &c) { c = EOF; while (!isalpha(c)) c = gc(); }
int gs(char s[]) { int l = 0; char c = gc(); while (isspace(c)) c = gc(); while (c != EOF && !isspace(c)) { s[l++] = c; c = gc(); } s[l] = '\0'; return l; }
template<class T> bool gi(T &v) {
    v = 0; char c = gc(); while (c != EOF && c != '-' && !isdigit(c)) c = gc(); if (c == EOF) return false; bool neg = c == '-'; if (neg) c = gc();
    while (isdigit(c)) { v = v * 10 + c - '0'; c = gc(); } if (neg) v = -v; return true;
}

const double PI = 2 * acos(0);
const string months[] = {"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};
const int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dr[] = {-1, +0, +1, +0};
const int dc[] = {+0, +1, +0, -1};
const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ld eps = ld(1e-9);
const ll mod = 100000007;
typedef pair<int, int> II;

int X, Y, S;

int main(){
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    cin >> X >> Y >> S;
    S *= 2;
    ll res = 0, t, a;
    For(x, 1, X) For(y, 1, Y){
        if(x * y < S) continue;
        if(x * y == S){
            t = (x + x + y + y) * (X - x + 1) * (Y - y + 1);
            res += t;
        }
        else{
            t = 0;
            if(S % x == 0) t++;
            if(S % y == 0) t++;
            For(i, 1, y - 1){
                if( (S - x * y + i * x) % i == 0){

                    a = (S - x * y + i * x) / i;
                    //if(x == 3 && y == 4) cout << a  << endl;
                    if(a > 0 && a < x) t++;
                }
                //if(x == 3 && y == 4) cout <<
                if((x * y - i * x - S) % y == 0){
                    a = (x * y - i * x - S) / y;
                    if(a > 0 && a < x) t++;
                }
            }
            //if(x == 3 && y == 4) cout << t  << endl;
           // if(x > 2 && y > 2 && t > 0) ok;
            res += t * 4 * (X - x + 1) * (Y - y + 1);
        }
    }
    cout << res << endl;
}

Code mẫu của khuc_tuan

#include <iostream>
#include <algorithm>
using namespace std;

int x, y, s;
long long result;
bool _mark[400000];
bool *mark;

int main() {
    // int tbegin = clock();
    mark = &_mark[200000];
    cin >> x >> y >> s;

        for (int i = 0; i <= x; ++i) {
            for(int v=-y;v<=y;++v) mark[v*i] = true;
            for (int j = -y; j <= y; ++j) if(i > 0 || j > 0) {
                for (int u = 0; u <= x; ++u) if (i == 0 || mark[(u * j - 2 * s)] || mark[(u * j + 2 * s)]) {
                    int minx = min(i, u);
                    minx = min(minx, 0);

                    int maxx = max(i, u);
                    maxx = max(maxx, 0);

                    if (maxx - minx <= x)

                    {
                        if(i == 0) {
                        for (int v = -y; v <= y; ++v) if(u > 0 || v > 0) {
                            if (abs(u * j - i * v) == 2 * s) {

                                int miny = min(j, v);
                                miny = min(miny, 0);

                                int maxy = max(j, v);
                                maxy = max(maxy, 0);

                                if (maxy - miny <= y)
                                    result += (x - (maxx - minx) + 1) * (y - (maxy - miny) + 1);
                            }
                        }
                        }
                        else {
                            if((u * j + 2 * s) % i == 0) {
                                int v = (u * j + 2 * s) / i;
                                int miny = min(j, v);
                                miny = min(miny, 0);

                                int maxy = max(j, v);
                                maxy = max(maxy, 0);

                                if ((u > 0 || v > 0) && maxy - miny <= y)
                                    result += (x - (maxx - minx) + 1) * (y - (maxy - miny) + 1);
                            }
                            if((u * j - 2 * s) % i == 0) {
                                int v = (u * j - 2 * s) / i;
                                int miny = min(j, v);
                                miny = min(miny, 0);

                                int maxy = max(j, v);
                                maxy = max(maxy, 0);

                                if ((u > 0 || v > 0) && maxy - miny <= y)
                                    result += (x - (maxx - minx) + 1) * (y - (maxy - miny) + 1);
                            }
                        }
                    }
                }
            }
            for(int v=-y;v<=y;++v) mark[v*i] = false;
        }

    cout << result / 2 << endl;
    // cout << clock() - tbegin << endl;
    return 0;   
}