Language: C++

#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;

const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ll MOD = (ll) (1e9 + 7);
const double PI = acos(-1.0);
const int limit = 200010;

#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbg2(x_) for(auto a_ : x_) cerr << a_ << " "; cerr << endl;
#define dbg3(x_ , sx_) rep(i, sx_) cerr << x_[i] << " "; cerr << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

//------------------------------------------------------

set<ll> primes;

void make_primes(int s = limit) {

    for (int i = 2; i <= s; ++i) {
        bool is_prime = true;
        for (auto p : primes) {
            if (i % p == 0) {
                is_prime = false;
                break;
            }
        }
        if (is_prime) primes.insert(i);
    }
}

void factrization(int a, vector<int> &v) {
    for (auto p : primes) {
        if (a == 1) return;
        while (a % p == 0) {
            v.push_back(p);
            a /= p;
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    make_primes(100);
    vector<int> v;
    for (int i = 1; i <= n; ++i) {
        factrization(i, v);
    }
    int factor[101] = {};
    for (auto p : v) factor[p]++;
    int ans = 0;

    //下記のパターンを調べる
    // p^2 * q^4 * r^4
    // p^2 * q^24
    // p^4 * q^14
    // p^74

    REP(i, 1, n + 1) REP(j, i + 1, n + 1) REP(k, j + 1, n + 1) {
        if (factor[i] >= 2 && factor[j] >= 4 && factor[k] >= 4) ans++;
        if (factor[i] >= 4 && factor[j] >= 2 && factor[k] >= 4) ans++;
        if (factor[i] >= 4 && factor[j] >= 4 && factor[k] >= 2) ans++;
    }

    REP(i, 1, n + 1) REP(j, i + 1, n + 1) {
        if (factor[i] >= 2 && factor[j] >= 24) ans++;
        if (factor[i] >= 4 && factor[j] >= 14) ans++;
        if (factor[i] >= 24 && factor[j] >= 2) ans++;
        if (factor[i] >= 14 && factor[j] >= 4) ans++;
    }

    REP(i, 1, n + 1) {
        if (factor[i] >= 74) ans++;
    }

    cout << ans << endl;
    return 0;
}#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;

const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ll MOD = (ll) (1e9 + 7);
const double PI = acos(-1.0);
const int limit = 200010;

#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbg2(x_) for(auto a_ : x_) cerr << a_ << " "; cerr << endl;
#define dbg3(x_ , sx_) rep(i, sx_) cerr << x_[i] << " "; cerr << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

//------------------------------------------------------

set<ll> primes;

void make_primes(int s = limit) {

    for (int i = 2; i <= s; ++i) {
        bool is_prime = true;
        for (auto p : primes) {
            if (i % p == 0) {
                is_prime = false;
                break;
            }
        }
        if (is_prime) primes.insert(i);
    }
}

void factrization(int a, vector<int> &v) {
    for (auto p : primes) {
        if (a == 1) return;
        while (a % p == 0) {
            v.push_back(p);
            a /= p;
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    make_primes(100);
    vector<int> v;
    for (int i = 1; i <= n; ++i) {
        factrization(i, v);
    }
    int factor[101] = {};
    for (auto p : v) factor[p]++;
    int ans = 0;

    //下記のパターンを調べる
    // p^2 * q^4 * r^4
    // p^2 * q^24
    // p^4 * q^14
    // p^74

    REP(i, 1, n + 1) REP(j, i + 1, n + 1) REP(k, j + 1, n + 1) {
        if (factor[i] >= 2 && factor[j] >= 4 && factor[k] >= 4) ans++;
        if (factor[i] >= 4 && factor[j] >= 2 && factor[k] >= 4) ans++;
        if (factor[i] >= 4 && factor[j] >= 4 && factor[k] >= 2) ans++;
    }

    REP(i, 1, n + 1) REP(j, i + 1, n + 1) {
        if (factor[i] >= 2 && factor[j] >= 24) ans++;
        if (factor[i] >= 4 && factor[j] >= 14) ans++;
        if (factor[i] >= 24 && factor[j] >= 2) ans++;
        if (factor[i] >= 14 && factor[j] >= 4) ans++;
    }

    REP(i, 1, n + 1) {
        if (factor[i] >= 74) ans++;
    }

    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc:101:2: error: stray '#' in program
  101 | }#include <bits/stdc++.h>
      |  ^
a.cc:101:3: error: 'include' does not name a type
  101 | }#include <bits/stdc++.h>
      |   ^~~~~~~
a.cc:113:11: error: redefinition of 'const int INF'
  113 | const int INF = (int) 1e9;
      |           ^~~
a.cc:13:11: note: 'const int INF' previously defined here
   13 | const int INF = (int) 1e9;
      |           ^~~
a.cc:114:10: error: redefinition of 'const ll LINF'
  114 | const ll LINF = (ll) 1e18;
      |          ^~~~
a.cc:14:10: note: 'const ll LINF' previously defined here
   14 | const ll LINF = (ll) 1e18;
      |          ^~~~
a.cc:115:10: error: redefinition of 'const ll MOD'
  115 | const ll MOD = (ll) (1e9 + 7);
      |          ^~~
a.cc:15:10: note: 'const ll MOD' previously defined here
   15 | const ll MOD = (ll) (1e9 + 7);
      |          ^~~
a.cc:116:14: error: redefinition of 'const double PI'
  116 | const double PI = acos(-1.0);
      |              ^~
a.cc:16:14: note: 'const double PI' previously defined here
   16 | const double PI = acos(-1.0);
      |              ^~
a.cc:117:11: error: redefinition of 'const int limit'
  117 | const int limit = 200010;
      |           ^~~~~
a.cc:17:11: note: 'const int limit' previously defined here
   17 | const int limit = 200010;
      |           ^~~~~
a.cc:131:13: error: redefinition of 'std::vector<int> Dx'
  131 | vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
      |             ^~
a.cc:31:13: note: 'std::vector<int> Dx' previously declared here
   31 | vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
      |             ^~
a.cc:132:13: error: redefinition of 'std::vector<int> Dy'
  132 | vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
      |             ^~
a.cc:32:13: note: 'std::vector<int> Dy' previously declared here
   32 | vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
      |             ^~
a.cc:136:9: error: redefinition of 'std::set<long long int> primes'
  136 | set<ll> primes;
      |         ^~~~~~
a.cc:36:9: note: 'std::set<long long int> primes' previously declared here
   36 | set<ll> primes;
      |         ^~~~~~
a.cc:138:6: error: redefinition of 'void make_primes(int)'
  138 | void make_primes(int s = limit) {
      |      ^~~~~~~~~~~
a.cc:38:6: note: 'void make_primes(int)' previously defined here
   38 | void make_primes(int s = limit) {
      |      ^~~~~~~~~~~
a.cc:152:6: error: redefinition of 'void factrization(int, std::vector<int>&)'
  152 | void factrization(int a, vector<int> &v) {
      |      ^~~~~~~~~~~~
a.cc:52:6: note: 'void factrization(int, std::vector<int>&)' previously defined here
   52 | void factrization(int a, vector<int> &v) {
      |      ^~~~~~~~~~~~
a.cc:162:5: error: redefinition of 'int main()'
  162 | int main() {
      |     ^~~~
a.cc:62:5: note: 'int main()' previously defined here
   62 | int main() {
      |     ^~~~