criyle/codenet-compile-errors huggingface dataset:
Language: C++

#include<iostream>
#include<string>
#include<cstdlib>
using namespace std;
int pow(int n){
    if(n==0)return 1;
    else return pow(n-1)*10;
}
int pow3(int n){
    if(n==0)return 1;
    else return pow(n-1)*3;
}
int decode(int code){
    if(code == 0)return 3;
    if(code == 1)return 5;
    if(code == 2)return 7;
    return (code % 3)*2+3+decode(code/3)*10
}
int _isSft(int value, int seven, int five, int three){
    if(value==0){
        return seven&&five&&three;
    }
    int tail=value%10;
    int head=value/10;
    if(tail == 7)return _isSft(head, 1, five,three);
    if(tail == 5)return _isSft(head, seven, 1,three);
    else return _isSft(head, seven, five,1);
}
int isSft(int value){
    return _isSft(value,0,0,0);
}
int getRank(int N){
    if(N==0)return 0;
    else return getRank(N/10)+1;
}
int get(int rank, int N){
    return (N/pow(rank))%10
}
int solve(int order, int N){
    if(order<=2){return 0;}
    else {
        int sum=0;
        int encodeMax=pow3(order);
        for(int i=0;i<encodeMax;i++){
            int sft=decode(i);
            if(sft<=N){
                if(isSft(sft)){
                    sum+=1;
                }
            }
        }
        return sum;
    }
}
int main(){
    int N;
    cin>>N;
    cout<<solve(9,N)<<endl;
}

Compiler output:
a.cc: In function 'int decode(int)':
a.cc:17:44: error: expected ';' before '}' token
   17 |     return (code % 3)*2+3+decode(code/3)*10
      |                                            ^
      |                                            ;
   18 | }
      | ~                                           
a.cc: In function 'int get(int, int)':
a.cc:37:28: error: expected ';' before '}' token
   37 |     return (N/pow(rank))%10
      |                            ^
      |                            ;
   38 | }
      | ~
Language: C++

#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"

using namespace std;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;

using vi = vector<int>;

constexpr char newl = '\n';
constexpr double eps = 1e-10;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define YESNO {cout<<"YES";}else{cout<<"NO";}
#define v(T) vector<T>

template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
  return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
  F0R(j, sz(v)) i >> v[j];
  return i;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
  F0R(i, v.size()) {
    o << v[i] << ' ';
  }
  o << newl;
  return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
  for (auto& p : m) {
    o << p.first << ": " << p.second << newl;
  }
  cout << newl;
  return o;
}

#if 1

#include "PrimeFactorization.h"

// INSERT ABOVE HERE
signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;

  map<int, int> m;
  auto cn = getCompositeNums(primeFactorization(75));
  cn.insert(cn.begin(), 1);
  //cout << cn;

  FOR(i, 2, N + 1) {
    auto pf = primeFactorization(i);
    for (auto& p : pf) {
      m[p.first] += p.second;
    }
  }
  //cout << m;

  vector<int> as;
  for (auto& p : m) {
    auto a = upper_bound(rng(cn), p.second + 1) - 1 - cn.begin();
    if (a) as.push_back(a);
  }
  //cout << as;

  int result = 0;
  auto dfs = [&](auto dfs, int v, int n)->void {
    if (v >= as.size()) return;
    F0R(i, as[v] + 1) {
      if (n % cn[i] == 0) {
        if (n == cn[i]) {
          result++;
          continue;
        }
        dfs(dfs, v + 1, n / cn[i]);
      }
    }

  };
  dfs(dfs, 0, 75);
  cout << result;
}
#endif


Compiler output:
a.cc:61:10: fatal error: PrimeFactorization.h: No such file or directory
   61 | #include "PrimeFactorization.h"
      |          ^~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<cstdio>
unsigned answer[101] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 8, 8, 11, 11, 11, 11, 14, 14, 32, 32, 35, 35, 35, 35, 42, 42, 42, 42, 49, 49, 49, 49, 49, 49, 75, 75, 86, 86, 86, 86, 86, 86, 123, 123, 131, 131, 131, 131, 148, 148, 153, 153, 170, 170, 170, 170, 170, 170, 227, 227, 227, 227, 227, 227, 250, 250, 323, 323, 324, 324, 324, 324, 354, 354, 354, 354, 384, 384, 384, 384, 384, 391, 491, 491, 529, 529, 529, 529, 529, 529, 543}

int main(){
    unsigned N;
    scanf("%u", &N);
    printf("%u\n", answer[N]);
    return 0;
}

Compiler output:
a.cc:4:1: error: expected ',' or ';' before 'int'
    4 | int main(){
      | ^~~
Language: C++

#include<cstdio>
unsigned answer[101] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 8, 8, 11, 11, 11, 11, 14, 14, 32, 32, 35, 35, 35, 35, 42, 42, 42, 42, 49, 49, 49, 49, 49, 49, 75, 75, 86, 86, 86, 86, 86, 86, 123, 123, 131, 131, 131, 131, 148, 148, 153, 153, 170, 170, 170, 170, 170, 170, 227, 227, 227, 227, 227, 227, 250, 250, 323, 323, 324, 324, 324, 324, 354, 354, 354, 354, 384, 384, 384, 384, 384, 391, 491, 491, 529, 529, 529, 529, 529, 529, 543}

int main(){
    unsigned N;
    scanf("%u", &N);
    printf("%u\n", answer[N]);
}

Compiler output:
a.cc:4:1: error: expected ',' or ';' before 'int'
    4 | int main(){
      | ^~~
Language: C++

#include<cstdin>
unsigned answer[101] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 8, 8, 11, 11, 11, 11, 14, 14, 32, 32, 35, 35, 35, 35, 42, 42, 42, 42, 49, 49, 49, 49, 49, 49, 75, 75, 86, 86, 86, 86, 86, 86, 123, 123, 131, 131, 131, 131, 148, 148, 153, 153, 170, 170, 170, 170, 170, 170, 227, 227, 227, 227, 227, 227, 250, 250, 323, 323, 324, 324, 324, 324, 354, 354, 354, 354, 384, 384, 384, 384, 384, 391, 491, 491, 529, 529, 529, 529, 529, 529, 543}

int main(){
    unsigned N;
    scanf("%u", &N);
    printf("%u\n", answer[N]);
}

Compiler output:
a.cc:1:9: fatal error: cstdin: No such file or directory
    1 | #include<cstdin>
      |         ^~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
//
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
//
vector<int> primes = {2, 3, 5, 7, 11 , 13, 17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
vector<int> cnt(25);
int main(){
    int n;
    cin >> n;
    for(int i = 0; i < 25; i++){
        int cur = primes[i];
        int div = cur;
        while(true){
            if(div > n) break;
            cnt[i] += n / div;
            div *= cur;
        }
    }
    int ans = 0;
    for(int i = 0; i < 25; i++) if(cnt[0] >= 74) ans++;
    for(int i = 0; i < 25; i++){
        for(int j = i + 1; j < 25; j++){
            if(cnt[i] >= 24 && cnt[j] >= 2) ans++;
            if(cnt[j] >= 24 && cnt[i] >= 2) ans++;
            if(cnt[i] >= 14 && cnt[j] >= 4) ans++;
            if(cnt[i] >= 4 && cnt[j] >= 14) ans++;
        }
    }
    for(int i = 0; i < 25; i++){
        for(int j = i + 1; j < 25; j++){
            for(int k = j + 1; k < 25; k++){
                if(cnt[i] >= 4 && cnt[j] >= 4 && cnt[k] >= 2) ans++;
                if(cnt[i] >= 4 && cnt[j] >= 2 && cnt[k] >= 4) ans++;
                if(cnt[i] >= 2 && cnt[j] >= 4 && cnt[k] >= 4) ans++;
            }
        }
    }
    cout << ans;
}

/*⠀⠀⠀⠀⠀⢀⣀⣀⣀    
⠀⠀⠀⠰⡿⠿⠛⠛⠻⠿⣷
⠀⠀⠀⠀⠀⠀⣀⣄⡀⠀⠀⠀⠀⢀⣀⣀⣤⣄⣀⡀
⠀⠀⠀⠀⠀⢸⣿⣿⣷⠀⠀⠀⠀⠛⠛⣿⣿⣿⡛⠿⠷
⠀⠀⠀⠀⠀⠘⠿⠿⠋⠀⠀⠀⠀⠀⠀⣿⣿⣿⠇
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠁

⠀⠀⠀⠀⣿⣷⣄⠀⢶⣶⣷⣶⣶⣤⣀
⠀⠀⠀⠀⣿⣿⣿⠀⠀⠀⠀⠀⠈⠙⠻⠗
⠀⠀⠀⣰⣿⣿⣿⠀⠀⠀⠀⢀⣀⣠⣤⣴⣶⡄
⠀⣠⣾⣿⣿⣿⣥⣶⣶⣿⣿⣿⣿⣿⠿⠿⠛⠃
⢰⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡄
⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡁
⠈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁
⠀⠀⠛⢿⣿⣿⣿⣿⣿⣿⡿⠟
⠀⠀⠀⠀⠀⠉⠉⠉
*/

Compiler output:
a.cc:8:11: error: redefinition of 'const int MOD'
    8 | const int MOD = 1e9 + 7;
      |           ^~~
a.cc:3:11: note: 'const int MOD' previously defined here
    3 | const int MOD = 1e9 + 7;
      |           ^~~
Language: C++

n = int(input())
p = (n+1)*[0]

for i in range(2, n+1):
    now = i
    for j in range(2, i+1):
        while now % j == 0:
            p[j] += 1
            now //= j


def cnt(m):
    return len(list(filter(lambda x: x >= m, p)))


ans = 0
ans += cnt(74)
ans += cnt(24)*(cnt(2)-1)
ans += cnt(14)*(cnt(4)-1)
ans += cnt(4)*(cnt(4)-1)*(cnt(2)-2)//2
print(ans)


Compiler output:
a.cc:1:1: error: 'n' does not name a type
    1 | n = int(input())
      | ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const ll INF = 1ll << 60;
int n;
int ans;
int pr[maxx];
int cnt[maxx];
int x3, x5, x15, x25, x75;

int main() {
	// 分解质因子 X = p1^x1 * p2^x2 * ... * pn^xn
	// X的因子个数 = (x1 + 1) * (x2 + 1) * ... * (xn + 1)
	// 75 --> 3 * 5 * 5 = 3 * 25 = 5 * 15 = 75
	int num = 0;
	for(int i = 2; i <= 100; i++) {
		bool chk = 1;
		for(int j = 2; j <= sqrt(i); j++) {
			if(i % j == 0) {
				chk = 0;
				break;
			}
		}
		if(chk) pr[++num] = i;
	}
	cin >> n;
	int num = 0;
	for(int i = 1; i <= n; i++) {
		int tmp = n;
		for(int j = 1; j <= cnt; j++) {
			while(tmp % pr[j] == 0) {
				cnt[j]++; // 质因子指数
				tmp /= pr[j];
			}
		}
	}
	for(int i = 1; i <= cnt; i++) {
		if(cnt[i] >= 2) x3++;
		if(cnt[i] >= 4) x5++;
		if(cnt[i] >= 14) x15++;
		if(cnt[i] >= 24) x25++;
		if(cnt[i] >= 74) x75++;
	}
	// 3 * 5 * 5
	ans += (x5 * (x5 - 1) / 2) * (x3 - 2); // Cx5\2 * C(x3 - 2)\1
	// 3 * 25
	ans += x25 * (x3 - 1); // Cx25\1 * C(x3 - 1)\1
	// 5 * 15
	ans += x15 * (x5 - 1) // Cx15\1 * C(x5 - 1)\1
	// 75
	ans += x75; //Cx75\1
	cout << ans << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:29:13: error: redeclaration of 'int num'
   29 |         int num = 0;
      |             ^~~
a.cc:17:13: note: 'int num' previously declared here
   17 |         int num = 0;
      |             ^~~
a.cc:32:34: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   32 |                 for(int j = 1; j <= cnt; j++) {
      |                                ~~^~~~~~
a.cc:39:26: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   39 |         for(int i = 1; i <= cnt; i++) {
      |                        ~~^~~~~~
a.cc:51:30: error: expected ';' before 'ans'
   51 |         ans += x15 * (x5 - 1) // Cx15\1 * C(x5 - 1)\1
      |                              ^
      |                              ;
   52 |         // 75
   53 |         ans += x75; //Cx75\1
      |         ~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
signed main(){
  int N; cin>>N;
  map<int> M;
  REP(i,2,N){
    int K=i;
    REP(j,2,K){
      while(K%j==0){
        M[j]++;
        K/=j;
      }
    }
  }
  int three=0,five=0;
  for(auto p:M){
    int X=p.first,Y=p.second;
    if(Y>=2)
      three++;
    if(Y>=4)
      five++;
  }
  int ans=max(0ll,five-1)*five*max(0ll,three-2);
  cout<<ans<<endl;
  }


Compiler output:
a.cc: In function 'int main()':
a.cc:17:10: error: wrong number of template arguments (1, should be at least 2)
   17 |   map<int> M;
      |          ^
In file included from /usr/include/c++/14/map:63,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:152,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_map.h:102:11: note: provided for 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:22:10: error: invalid types 'int[long long int]' for array subscript
   22 |         M[j]++;
      |          ^
a.cc:28:14: error: 'begin' was not declared in this scope
   28 |   for(auto p:M){
      |              ^
a.cc:28:14: note: suggested alternatives:
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166:
/usr/include/c++/14/valarray:1238:5: note:   'std::begin'
 1238 |     begin(const valarray<_Tp>& __va) noexcept
      |     ^~~~~
In file included from /usr/include/c++/14/filesystem:53,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:200:
/usr/include/c++/14/bits/fs_dir.h:608:3: note:   'std::filesystem::__cxx11::begin'
  608 |   begin(recursive_directory_iterator __iter) noexcept
      |   ^~~~~
a.cc:28:14: error: 'end' was not declared in this scope
   28 |   for(auto p:M){
      |              ^
a.cc:28:14: note: suggested alternatives:
/usr/include/c++/14/valarray:1265:5: note:   'std::end'
 1265 |     end(const valarray<_Tp>& __va) noexcept
      |     ^~~
/usr/include/c++/14/bits/fs_dir.h:613:3: note:   'std::filesystem::__cxx11::end'
  613 |   end(recursive_directory_iterator) noexcept
      |   ^~~
a.cc:30:8: error: 'Y' was not declared in this scope
   30 |     if(Y>=2)
      |        ^
a.cc:32:8: error: 'Y' was not declared in this scope
   32 |     if(Y>=4)
      |        ^
Language: C++

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#include <cstdint>
#include <complex>
#include <bitset>

#define rep(i,n) for (int i = 0; i < (n); ++i)

using namespace std;
typedef long long ll;
typedef pair<int, int> pint;

const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int main() {
    int n; cin >> n;
    map<int, int> mp;
    for (int i = 2; i <= n; i++) {
        int num = i;
        int j = 2;
        while (j * j <= num) {
            while (num % j == 0) {
                mp[j]++;
                num /= j;
            }
            j++;
        }
        if (num > 1) mp[num]++;
    }

    vector<int> box;
    for (auto m: mp) {
        box.push_back(m.second);
    }
    sort(box.begin(), box.end());

    int ans = 0;

    for (int i = 0; i < box.size(); i++) {
        if (box[i] >= 74) ans++;
        for (int j = i+1; j < box.size(); j++) {
            if (box[i] >= 2 && box[j] >= 24) ans++;
            if (box[i] >= 24 && box[j] >= 2) ans++
            if (box[i] >= 4 && box[j] >= 14) ans++;
            if (box[i] >= 14 && box[j] >= 4) ans++;
            for (int k = j+1; k < box.size(); k++) {
                if (box[i] >= 2 && box[j] >= 4 && box[k] >= 4) ans++;
                if (box[i] >= 4 && box[j] >= 2 && box[k] >= 4) ans++;
                if (box[i] >= 4 && box[j] >= 4 && box[k] >= 2) ans++;
            }
        }
    }

    cout << ans << endl;

    return 0;
}


    


Compiler output:
a.cc: In function 'int main()':
a.cc:60:51: error: expected ';' before 'if'
   60 |             if (box[i] >= 24 && box[j] >= 2) ans++
      |                                                   ^
      |                                                   ;
   61 |             if (box[i] >= 4 && box[j] >= 14) ans++;
      |             ~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,p,q;cin>>n;
    vector<int>a(n);
    int ans=0;
    for(int i=0;i<n;i++){cin>>a[i];}
    for(int j=1;j<n-1;j++){
        p=0;q=0;
        for(int i=0;i<j;i++){if(a[i]<a[j]){p++;}}
        for(int k=j+1;k<n;k++){if(a[j]>a[k]){q++;}}
        ans+=p*q;
    }
    cout<<max(ans,0);
}

Compiler output:
a.cc: In function 'int main()':
a.cc:18:14: error: no matching function for call to 'max(long long int&, int)'
   18 |     cout<<max(ans,0);
      |           ~~~^~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:18:14: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   18 |     cout<<max(ans,0);
      |           ~~~^~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:18:14: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   18 |     cout<<max(ans,0);
      |           ~~~^~~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG

/**
 * For DEBUG
 * https://github.com/ta7uw/cpp-pyprint
 */
#include "cpp-pyprint/pyprint.h"

#endif

map<ll, ll> prime_factorize(ll N) {
    map<ll, ll> res;
    for (ll i = 2; i * i <= N; ++i) {
        while (N % i == 0) {
            res[i]++;
            N /= i;
        }
    }
    if (N != 1) res[N] = 1;
    return res;
}


void Main() {
    ll N;
    cin >> N;
    map<ll, ll> div;
    rep2(i, 1, N + 1) {
        for (auto p : prime_factorize(i)) {
            div[p.first] += p.second;
        }
    }
    ll ans = 0;
    for (P p : div) {
        if (p.second >= 74) {
            ans++;
        }
    }
    ll a24 = 0;
    ll a2 = 0;
    for (P p : div) {
        if (p.second >= 24) {
            a24++;
        }
        if (p.second >= 2) {
            a2++;
        }
    }
    ans += a24 * (a2 - 1);

    ll a14 = 0;
    ll a4 = 0;
    for (P p : div) {
        if (p.second >= 14) {
            a14++;
        }
        if (p.second >= 4) {
            a4++;
        }
    }
    ans += a14 * (a4 - 1);

    ll b4 = 0;
    ll b2 = 0;
    for (P p : div) {
        if (p.second >= 4) {
            b4++;
        }
        if (p.second >= 2) {
            b2++;
        }
    }
    ans += (b4 - 1) * b4 * (b2 - 2) / 2;
    print(ans);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    Main();
    return 0;
}


Compiler output:
a.cc: In function 'void Main()':
a.cc:90:5: error: 'print' was not declared in this scope; did you mean 'rint'?
   90 |     print(ans);
      |     ^~~~~
      |     rint
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin >> n;
  
 int a[110]={0};
  
  for(int i=2;i<=n;i++){
    
    int sum=i;
    for(int j=2;j<=i;j++){
      
      while(sum%i==0){
        a[j]++;
        
        num/=j;
      }
      
    }
  }
  
 int p[100]={0};
  
  for(int i=2;i<=n;i++){
    
    if(a[i]>=74){//75*1 = 74と0 = 同じ数が74 あとは同様に
      
      p[75]++;
    }
    
    if(a[i]>=24){
      p[25]++;
    }
    
    if(a[i]>=14){
      
      p[15]++;
    }
    
    if(a[i]>=4){
      p[5]++;
    }
    
    if(a[i]>=2){
      p[3]++;
    }
  }
  //全部合わせる
  //同じ素数が多いほう(25個ある方など)から先に選択すると少ないほうは必ず一つ要素が減っている。
  cout << p[75]+p[25]*(p[3]-1)+p[15]*(p[5]-1)+p[5]*(p[5]-1)/2*(p[3]-2) << endl;
  
}


Compiler output:
a.cc: In function 'int main()':
a.cc:17:9: error: 'num' was not declared in this scope; did you mean 'sum'?
   17 |         num/=j;
      |         ^~~
      |         sum
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin >> n;
  
 int a[110]={0};
  
  for(int i=2;i<=n;i++){
    
    int sum=i;
    for(int j=2;j<=i;j++){
      
      while(sum%i==0){
        a[j]++;
        
        num/=j;
      }
      
    }
  }
  
 int p[100]={0};
  
  for(int i=2;i<=n;i++){
    
    if(a[i]>=74){//75*1 = 74と0 = 同じ数が74 あとは同様に
      
      p[75]++;
    }
    
    if(a[i]>=24){
      p[25]++;
    }
    
    if(a[i]>=14){
      
      p[15]++;
    }
    
    if(a[i]>=4){
      p[5]++;
    }
    
    if(a[i]>=2){
      p[3]++;
    }
  }
  //全部合わせる
  //同じ素数が多いほう(25個ある方など)から先に選択すると少ないほうは必ず一つ要素が減っている。
  cout << x[75]+x[25]*(x[3]-1)+x[15]*(x[5]-1)+x[5]*(x[5]-1)/2*(x[3]-2) << endl;
  
}


Compiler output:
a.cc: In function 'int main()':
a.cc:17:9: error: 'num' was not declared in this scope; did you mean 'sum'?
   17 |         num/=j;
      |         ^~~
      |         sum
a.cc:51:11: error: 'x' was not declared in this scope
   51 |   cout << x[75]+x[25]*(x[3]-1)+x[15]*(x[5]-1)+x[5]*(x[5]-1)/2*(x[3]-2) << endl;
      |           ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin >> n;
  
 int a[110]={0};
  
  for(int i=2;i<=n;i++){
    
    int sum=i;
    for(int j=2;j<=i;j++){
      
      while(sum%i==0){
        a[j]++;
        
        num/=j;
      }
      
    }
  }
  
 int p[100]={0};
  
  for(int i=2;i<=n;i++){
    
    if(c[i]>=74){//75*1 = 74と0 = 同じ数が74 あとは同様に
      
      x[75]++;
    }
    
    if(c[i]>=24){
      x[25]++;
    }
    
    if(c[i]>=14){
      
      x[15]++;
    }
    
    if(c[i]>=4){
      x[5]++;
    }
    
    if(c[i]>=2){
      x[3]++;
    }
  }
  //全部合わせる
  //同じ素数が多いほう(25個ある方など)から先に選択すると少ないほうは必ず一つ要素が減っている。
  cout << x[75]+x[25]*(x[3]-1)+x[15]*(x[5]-1)+x[5]*(x[5]-1)/2*(x[3]-2) << endl;
  
}


Compiler output:
a.cc: In function 'int main()':
a.cc:17:9: error: 'num' was not declared in this scope; did you mean 'sum'?
   17 |         num/=j;
      |         ^~~
      |         sum
a.cc:27:8: error: 'c' was not declared in this scope
   27 |     if(c[i]>=74){//75*1 = 74と0 = 同じ数が74 あとは同様に
      |        ^
a.cc:29:7: error: 'x' was not declared in this scope
   29 |       x[75]++;
      |       ^
a.cc:32:8: error: 'c' was not declared in this scope
   32 |     if(c[i]>=24){
      |        ^
a.cc:33:7: error: 'x' was not declared in this scope
   33 |       x[25]++;
      |       ^
a.cc:36:8: error: 'c' was not declared in this scope
   36 |     if(c[i]>=14){
      |        ^
a.cc:38:7: error: 'x' was not declared in this scope
   38 |       x[15]++;
      |       ^
a.cc:41:8: error: 'c' was not declared in this scope
   41 |     if(c[i]>=4){
      |        ^
a.cc:42:7: error: 'x' was not declared in this scope
   42 |       x[5]++;
      |       ^
a.cc:45:8: error: 'c' was not declared in this scope
   45 |     if(c[i]>=2){
      |        ^
a.cc:46:7: error: 'x' was not declared in this scope
   46 |       x[3]++;
      |       ^
a.cc:51:11: error: 'x' was not declared in this scope
   51 |   cout << x[75]+x[25]*(x[3]-1)+x[15]*(x[5]-1)+x[5]*(x[5]-1)/2*(x[3]-2) << endl;
      |           ^
Language: Java

import java.util.*;
public class Main {
		
	public static void main(String[] args) {		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		sc.close();
	
		int prime[] = new int[N+1];
		Arrays.fill(prime, 1);
		for(int k=2;k<=N;k++) {
			int tmp = k;
			for(int i=2;i*i<=k;i++) {
				while(tmp%i==0) {
					tmp /= i;
					prime[i]++;
				}
			}
			if(tmp!=1)prime[tmp]++;
			
		}
		
		int _3up = 0;
		int _5up = 0;
		int _15up = 0;
		int _25up = 0;
		int _75up = 0;
		
		for(int i=0;i<N+1;i++) {
			
			if(prime[i]>=75) _75up ++;
			else if(prime[i]>=25) _25up ++;
			else if(prime[i]>=15) _15up ++;
			else if(prime[i]>=5)  _5up ++;
			else if(prime[i]>=3)  _3up ++;
		}
		
		int sum5 = _75up + _25up + _15up + _5up + _3up;
		int sum4 = _75up + _25up + _15up + _5up;
		int sum3 = _75up + _25up + _15up;
		int sum2 = _75up + _25up;
		int sum1 = _75up;
		
		int ans = sum1 + sum2 * (sum5 - 1) + sum3 * (sum4 - 1) + sum4 * (sum4 - 1)/2 * (sum5 - 2);
				
		
		System.out.println(ans);
	}
	
	

Compiler output:
Main.java:48: error: reached end of file while parsing
	}
	 ^
1 error
Language: C++

#include "stdafx.h"
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <tuple>
#include <numeric>
#include <assert.h>
#include <functional>
#include <unordered_map>
#include <cstdint>

using namespace std;

/*-----------------------------------------------------------------------------
　定義
 -------------------------------------------------------------------------------*/
#define REP(i, n)				for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n)			for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define INF						2e9
#define MOD						(1000 * 1000 * 1000 + 7)
#define Ceil(x, n)				(((((x))+((n)-1))/n))		/* Nの倍数に切り上げ割り算 */
#define CeilN(x, n)				(((((x))+((n)-1))/n)*n)		/* Nの倍数に切り上げ */
#define FloorN(x, n)			((x)-(x)%(n))				/* Nの倍数に切り下げ */
#define IsOdd(x)				(((x)&0x01UL) == 0x01UL)			
#define IsEven(x)				(!IsOdd((x)))						
#define ArrayLength(x)			(sizeof( x ) / sizeof( x[ 0 ]))
#define	MAX_QWORD				((QWORD)0xFFFFFFFFFFFFFFFF)
#define M_PI					3.14159265358979323846
typedef long long				ll;
typedef unsigned long long int	QWORD;
typedef unsigned long long		SQWORD;
typedef pair<ll, ll>			P;

/*-----------------------------------------------------------------------------
　処理
 -------------------------------------------------------------------------------*/
/* 素因数分解 */
map<ll, ll> factList;
void primeFactor(ll n)
{
	if ((n % 2) == 0){
		while((n % 2) == 0) {
			factList[2]++;
			n = n / 2;
		}
	}

	for(ll i = 3; i <= sqrt(n); i += 2){
		while ((n % i) == 0){
			factList[i]++;
			n = n / i;
		}
	}

	if (n != 1) {
		factList[n]++;
	}
}

int main()
{
	int N;
	cin >> N;
	
	for (int i = 1; i <= N; i++) {
		primeFactor(i);
	}

	// 0乗分を加算
	vector<int> factCnt;
	for (auto& factOne : factList) {
		factOne.second++;
		factCnt.emplace_back(factOne.second);
	}

	int ans = 0;
	for (size_t i = 0; i < factCnt.size(); i++) {
		for (size_t j = 0; j < factCnt.size(); j++) {
			for (size_t k = j + 1; k < factCnt.size(); k++) {
				if (i != j && j != k && k != i) {
					if (3 <= factCnt[i] && 5 <= factCnt[j] && 5 <= factCnt[k]) {
						ans++;
					}
				}
				if (i == j && j != k) {
					if (8 <= factCnt[i] && 5 <= factCnt[k]) {
						ans++;
					}
				}
				if (i != j && j == k) {
					if (3 <= factCnt[i] && 10 <= factCnt[j]) {
						ans++;
					}
				}
				if (i == j && j == k) {
					if (13 <= factCnt[i]) {
						ans++;
					}
				}
			}
		}
	}

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


Compiler output:
a.cc:1:10: fatal error: stdafx.h: No such file or directory
    1 | #include "stdafx.h"
      |          ^~~~~~~~~~
compilation terminated.
Language: C++

  function<int(int)> cnt = [&](int val) {
    int cnt = 0;
    for (auto m : mp) {
      if (m.second >= val) cnt++;
    }
    return cnt;
  };

Compiler output:
a.cc:1:3: error: 'function' does not name a type; did you mean 'union'?
    1 |   function<int(int)> cnt = [&](int val) {
      |   ^~~~~~~~
      |   union
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

// N!を素因数分解してmapに表示
map<long long, int> prime_factor(long long N){
    map< long long, int> ret;
    for(long long n = 1; n <= N; n++){
        ll tmpn = n;
        for(long long i = 2; i * i <= n; i++){
            while(tmpn % i == 0){
                ret[i]++;
                tmpn /= i;
            }
        }
        if(tmpn != 1) ret[tmpn]++;
    }
    return ret;
}

int main(){
    ll N; cin >> N;
    unordered_map<ll,int> ret = prime_factor(N);
    int cnt = 0;

    //a^2b^4c^4パターン
    for(auto e: ret){
        for(auto f: ret){
            if(e == f) continue;
            for(auto g: ret){
                if(e == g || f == g) continue;
                if(f.first > g.first) continue;
                
                if(e.second >= 2 && f.second >= 4 && g.second >= 4) cnt++;
            }
        }
    }
    
    //a^4b^14パターン
    for(auto e: ret){
        for(auto f: ret){
            if(e == f) continue;

            if(e.second >= 14 && f.second >= 4) cnt++; 
        }
    }

    // a^3b^25パターン
    for(auto e: ret){
        for(auto f: ret){
            if(e == f) continue;

            if(e.second >= 24 && f.second >= 2) cnt++;
        }        
    }

    // a^74パターン
    for(auto e: ret){
        if(e.second >= 74) cnt++;
    }
    cout << cnt << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:23:45: error: conversion from 'std::map<long long int, int>' to non-scalar type 'std::unordered_map<long long int, int>' requested
   23 |     unordered_map<ll,int> ret = prime_factor(N);
      |                                 ~~~~~~~~~~~~^~~
Language: C++

n = int(input())

import math


def isPrime(x):
  if x == 2:
    return True
  if x % 2 == 0:
    return False
  for i in range(3, int(math.sqrt(x)) + 1, 2):
    if x % i == 0:
      return False
  return True

# primes=[]
# for i in range(2,100):
#   if isPrime(i):
#     primes.append(i)


primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
          41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

pows = {}
for p in primes:
  if p > n:
    break
  pows[p] = 0
  pp = p
  while n // pp >= 1:
    pows[p] += n // pp
    pp *= p

e = []
for x in pows.values():
  e.append(x + 1)
#print(e)

import itertools
ans = 0

for x in e:
  if x >= 75:
    ans += 1

for (x, y) in itertools.combinations(e, 2):
  #print(x, y)
  for a, b in [(25, 3), (15, 5), (5, 15), (3, 25)]:
    if x >= a and y >= b:
      ans += 1

for (x, y, z) in itertools.combinations(e, 3):
  #print(x, y, z)
  for a, b, c in [[5, 5, 3], [5, 3, 5], [3, 5, 5]]:
    if x >= a and y >= b and z >= c:
      ans += 1

print(ans)


Compiler output:
a.cc:16:3: error: invalid preprocessing directive #primes
   16 | # primes=[]
      |   ^~~~~~
a.cc:17:3: error: invalid preprocessing directive #for
   17 | # for i in range(2,100):
      |   ^~~
a.cc:18:15: error: missing binary operator before token "("
   18 | #   if isPrime(i):
      |               ^
a.cc:18: error: unterminated #if
   18 | #   if isPrime(i):
a.cc:1:1: error: 'n' does not name a type
    1 | n = int(input())
      | ^
Language: C++

#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#define ll long long

std::vector<std::vector<int> > factors(120, std::vector<int>(120));

void INIT_factors(){
  for(int i=1; i<factors.size(); i++){
    int temp = i;
    for(int j=2; j<=temp; j++){
      int count = 0;
      while(temp%j == 0){
	temp/=j;
	count++;
      }
      factors[i][j] = count;
    }
  }
}


int comb( int n, int k )
{
  if (k > n) return 0;
  if (k * 2 > n) k = n-k;
  if (k == 0) return 1;

  int result = n;
  for( int i = 2; i <= k; ++i ) {
    result *= (n-i+1);
    result /= i;
  }
  return result;
}

int main(void){
  INIT_factors();

  int n;
  std::cin >> n;

  int ge14 = 0;
  int ge24 = 0;
  int ge74 = 0;
  int ge4 = 0;
  int ge2 = 0;
  std::vector<int> v(120);
  for(int i=1; i<120; i++){
    for(int j=2; j<=n; j++){
      v[i] += factors[j][i];
    }
    ge4 += v[i]>=4 ? 1 : 0;
    ge2 += v[i]>=2 ? 1 : 0;
    ge14 += v[i]>=14 ? 1 : 0;
    ge24 += v[i]>=24 ? 1 : 0;
    ge74 += v[i]>=74 ? 1 : 0;
  }

  /*for(int i=0; i<v.size(); i++){
    std::cout << v[i] << " ";
  }
  std::cout << std::endl;*/

  int count = comb(ge4, 2) * comb(ge2-2, 1);
  count += comb(ge14, 1) * comb(ge4-1, 1);
  count += comb(ge24, 1) * comb(ge2-1, 1);
  count += comb(ge74, 1);
  std::cout << count << std::endl;
  return 0;
}


Compiler output:
a.cc:8:6: error: 'vector' in namespace 'std' does not name a template type
    8 | std::vector<std::vector<int> > factors(120, std::vector<int>(120));
      |      ^~~~~~
a.cc:6:1: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
    5 | #include <map>
  +++ |+#include <vector>
    6 | #define ll long long
a.cc: In function 'void INIT_factors()':
a.cc:11:18: error: 'factors' was not declared in this scope; did you mean 'acos'?
   11 |   for(int i=1; i<factors.size(); i++){
      |                  ^~~~~~~
      |                  acos
a.cc: In function 'int main()':
a.cc:50:8: error: 'vector' is not a member of 'std'
   50 |   std::vector<int> v(120);
      |        ^~~~~~
a.cc:50:8: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
a.cc:50:15: error: expected primary-expression before 'int'
   50 |   std::vector<int> v(120);
      |               ^~~
a.cc:53:7: error: 'v' was not declared in this scope
   53 |       v[i] += factors[j][i];
      |       ^
a.cc:53:15: error: 'factors' was not declared in this scope; did you mean 'acos'?
   53 |       v[i] += factors[j][i];
      |               ^~~~~~~
      |               acos
a.cc:55:12: error: 'v' was not declared in this scope
   55 |     ge4 += v[i]>=4 ? 1 : 0;
      |            ^
Language: C++

#include <iostream>
#include <vector>

using namespace std;

bool isprime[110];
int cnt[110];
vector<int> prime;
int n;

void init() {
  memset(isprime, true, sizeof(isprime));
  for (int i=2;i<110;i++) {
    if (isprime[i]) {
      prime.push_back(i);
      for (int j=2*i;j<110;j+=i) {
        isprime[j] = false;
      }
    }
  }
}

void solve() {
  init();
  for (int i=0;i<=n;i++) {
    int tmp = i;
    for (int j=0;j<prime.size() && tmp > 1;j++) {
      while (tmp % prime[j] == 0) {
        cnt[j]++;
        tmp /= prime[j];
      }
    }
  }

  vector<int> factor = {2, 4, 14, 24, 74};
  vector<int> factorCnt(5);
  for (int i=0;i<prime.size();i++) {
    for (int j=0;j<factor.size();j++) {
      if (cnt[i] >= factor[j]) {
        factorCnt[j]++;
      }
    }
  }



  int ans = factorCnt[4] +
            factorCnt[3] * max(0, factorCnt[0] - 1) +
            factorCnt[2] * max(0, factorCnt[1] - 1) +
            factorCnt[1] * max(0, factorCnt[1] - 1) * max(0, factorCnt[0] - 2) / 2;
  cout << ans << endl;
}

int main() {
  cin >> n;
  solve();
}


Compiler output:
a.cc: In function 'void init()':
a.cc:12:3: error: 'memset' was not declared in this scope
   12 |   memset(isprime, true, sizeof(isprime));
      |   ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    2 | #include <vector>
  +++ |+#include <cstring>
    3 |
Language: C++

#include <iostream>
using namespace std;
int yaku[100];
int main(){
  int n;cin>>n;
  for(int i = 2; n+1 > i; i++){
    int tmp = i;
    for(int j = 2; tmp != 1; j++){
      if(tmp % j == 0){
        yaku[j]++;
        tmp/=j;
        j--;
      }
    }
  }
  vector<int> kore;
  for(int i = 0; 100 > i; i++){
    if(yaku[i]>2)kore.push_back(yaku[i]);
  }
  sort(kore.begin(),kore.end());
  int k3 = 0;
  int k5 = 0;
  int k15 = 0;
  int k25 = 0;
  int k75 = 0;
  for(int i = 0; kore.size() > i; i++){
    if(kore[i] >= 75)k75++;
    if(kore[i] >= 25)k25++;
    if(kore[i] >= 15)k15++;
    if(kore[i] >=  5)k5++;
    if(kore[i] >=  3)k3++;
  }
  int ans = 0;
  
  //75
  ans += k75;
  
  //5 15
  ans += k15*(k5-1);
  
  //3 25
  ans += k25*(k3-1);
  
  //3 5 5
  ans += k5*(k5-1)*k3;
  
  cout << ans << endl;
}
    
      
  

Compiler output:
a.cc: In function 'int main()':
a.cc:16:3: error: 'vector' was not declared in this scope
   16 |   vector<int> kore;
      |   ^~~~~~
a.cc:2:1: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
    1 | #include <iostream>
  +++ |+#include <vector>
    2 | using namespace std;
a.cc:16:10: error: expected primary-expression before 'int'
   16 |   vector<int> kore;
      |          ^~~
a.cc:18:18: error: 'kore' was not declared in this scope
   18 |     if(yaku[i]>2)kore.push_back(yaku[i]);
      |                  ^~~~
a.cc:20:8: error: 'kore' was not declared in this scope
   20 |   sort(kore.begin(),kore.end());
      |        ^~~~
a.cc:20:3: error: 'sort' was not declared in this scope; did you mean 'short'?
   20 |   sort(kore.begin(),kore.end());
      |   ^~~~
      |   short
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,j,n) for(int i=(j);i<(n);i++)
#define repe(i,j,n) for(int i=(j);i<=(n);i++)


map<int,int>cnt;

signed main(){
	int n;cin>>n;
	for(int i=2;i<=n;i++){
	int x=i;
	for(int j=2;j*j<=x;j++){
		while(x%j==0){
		cnt[j]++;x/=j;
		}
	}
		if(x>0)cnt[x]++;
	}
	int c3=0,c5=0;
	for(auto&& u:cnt){
		if(u.second>=4)c5++;
		else if(u.second>=2)c3++;
	}
	int ret=c5*(c5-1)/2*c3;
	ret+=c5*(c5-1)*(c5-2)/6;
	cout<<ret<<endl;
	for(auto&& u:cnt)u.first<<" "<<u.second<<endl;

}




Compiler output:
a.cc: In function 'int main()':
a.cc:30:33: error: invalid operands of types 'const long long int' and 'const char [2]' to binary 'operator<<'
   30 |         for(auto&& u:cnt)u.first<<" "<<u.second<<endl;
      |                          ~~~~~~~^~~~~
      |                            |      |
      |                            |      const char [2]
      |                            const long long int
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repf(i,j,n) for(int i=(j);i<(n);i++)
#define repe(i,j,n) for(int i=(j);i<=(n);i++)


map<int,int>cnt;

signed main(){
	int n;cin>>n;
	for(int i=2;i<=n;i++){
	int x=i;
	for(int j=2;j*j<=x;j++){
		while(x%j==0){
		cnt[j]++;x/=j;
		}
	}
		if(x>0)cnt[x]++;
}
	int c3=0,c5=0;
	for(auto&& u:cnt){
		if(u.second>=5)c5++;
		else if(u.secont>=3)c3++;
	}
	int ret=c5*(c5-1)/2*c3;
	ret+=c5*(c5-1)*(c5-2)/6;
	cout<<ret<<endl;

}




Compiler output:
a.cc: In function 'int main()':
a.cc:25:27: error: 'struct std::pair<const long long int, long long int>' has no member named 'secont'; did you mean 'second'?
   25 |                 else if(u.secont>=3)c3++;
      |                           ^~~~~~
      |                           second
Language: C++

#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#include "prettyprint.hpp"

int findLargerThan(map<int, int> divs, int num) {
  int count = 0;
  for (int i = 1; i <= 100; i++) {
    if (divs[i] >= num) count++;
  }
  return count;
}

int main() {
  int N;
  cin >> N;
  map<int, int> divs;
  for (int i = 1; i <= 100; i++) {
    divs[i] = 0;
  }

  for (int i = 2; i <= N; i++) {
    int currentValue = i;
    for (int j = 2; j <= currentValue; j++) {
      while (currentValue % j == 0) {
        divs[j]++;
        currentValue = currentValue / j;
      }
    }
  }

  int l2 = findLargerThan(divs, 2);
  int l4 = findLargerThan(divs, 4);
  int l14 = findLargerThan(divs, 14);
  int l24 = findLargerThan(divs, 24);
  int l74 = findLargerThan(divs, 74);

  int ans = 0;
  if (l2 > 2) ans += (l4 * (l4 - 1) / 2) * (l2 - 2);
  if (l4 > 1) ans += l14 * (l4 - 1);
  if (l2 > 1) ans += l24 * (l2 - 1);
  ans += l74;

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

Compiler output:
a.cc:11:10: fatal error: prettyprint.hpp: No such file or directory
   11 | #include "prettyprint.hpp"
      |          ^~~~~~~~~~~~~~~~~
compilation terminated.
Language: Java

import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.IntStream;
import java.util.stream.LongStream;

import library.common.Predef;

public class Main {
    static final PrintStream so = System.out;
    static final Scanner sc = new Scanner(System.in);
    
    
    public static void main(String[] args) {
        int n = ni();
        int[] count = new int[n+1];
        for (int i = 2; i <= n; i++) {
            int[] count_i = factoring(i);
            for (int j = 0; j < count_i.length-1; j++) {
                count[j+1] += count_i[j+1];
            }
        }
        Predef.println(count);
        
        // 75 = 5*5*3 = 25*3 = 15*5 = 75
        int count75 = count(count, 74);
        int count24 = count(count, 24);
        int count14 = count(count, 14);
        int count4 = count(count, 4);
        int count2 = count(count, 2);

        long ans = comb(count4, 2) * (count2-2)
                 + count14 * (count4-1)
                 + count24 * (count2-1)
                 + count75;
                
        so.println(ans);
    }
    
    static int count(int[] a, int least) {
        return (int) IntStream.of(a).filter(i -> i >= least).count();
    }
    
    static long comb(int N, int R) {
        long prod1 = LongStream.rangeClosed(N-R+1, N).reduce((i, j) -> i*j).getAsLong();
        long prod2 = LongStream.rangeClosed(    1, R).reduce((i, j) -> i*j).getAsLong();
        return prod1 / prod2;
    }
    
    static int[] factoring(int argn)  {
        int n = argn;
        int[] count = new int[n+1];
        int[] primes = primes(n);
        int idx = 0;
        while (n > 1) {
            int prime = primes[idx];
            if (n % prime == 0) {
                count[prime]++;
                n /= prime;
            } else {
                idx++;
            }
        }
        return count;
    }
    
    static int[] primes(int max) {
        boolean[] isPrime = new boolean[max + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;
        
        for (int n = 2; n <= Math.sqrt(max); n++) {
            if (!isPrime[n])
                continue;
            
            for (int i = 2; n*i <= max; i++)
                isPrime[n*i] = false;
        }
        
        return IntStream.rangeClosed(2, max)
                        .filter(n -> isPrime[n])
                        .toArray();
    }
    
    static int ni() {
        return sc.nextInt();
    }
}


Compiler output:
Main.java:7: error: package library.common does not exist
import library.common.Predef;
                     ^
Main.java:23: error: cannot find symbol
        Predef.println(count);
        ^
  symbol:   variable Predef
  location: class Main
2 errors
Language: C++

N=int(input())
e=[0]*(N+1)
for i in range(2,N+1):
    cur=i
    for j in range(2,i+1):
        while cur%j==0:
            e[j]+=1
            cur//=j

def num(m):
    return len(list(filter(lambda x: x>=m-1, e)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)+num(5)*(num(5)-1)*(num(3)-2)//2)

Compiler output:
a.cc:1:1: error: 'N' does not name a type
    1 | N=int(input())
      | ^
Language: C++

#include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int prime[25] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
    int count[25];

    std::memset(count,0,sizeof(count));

    for(int i=1; i <= N; i++){
        for(int j=0; j<25; j++){
            int cur = i;
            int prime_tmp = prime[j];
            while (cur % prime_tmp == 0){
                cur /= prime_tmp;
                count[j] += 1;
            }
        }
    }

    int ans = 0;

    //1: 2*24 //
    int c_2 = 0;
    int c_24 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 24){c_24++;}
    }

    ans += (c_2-1) * c_24;

    //2: 2*4*4 //
    c_2 = 0;
    int c_4 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 4){c_4++;}
    }

    ans += (c_2-2) * (c_4*(c_4-1)/2);

    cout << ans << endl;

    return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:10: error: 'memset' is not a member of 'std'; did you mean 'wmemset'?
   11 |     std::memset(count,0,sizeof(count));
      |          ^~~~~~
      |          wmemset
Language: C++

#include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int prime[25] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
    int count[25];

    memset(count,0,sizeof(count));

    for(int i=1; i <= N; i++){
        for(int j=0; j<25; j++){
            int cur = i;
            int prime_tmp = prime[j];
            while (cur % prime_tmp == 0){
                cur /= prime_tmp;
                count[j] += 1;
            }
        }
    }

    int ans = 0;

    //1: 2*24 //
    int c_2 = 0;
    int c_24 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 24){c_24++;}
    }

    ans += (c_2-1) * c_24;

    //2: 2*4*4 //
    c_2 = 0;
    int c_4 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 4){c_4++;}
    }

    ans += (c_2-2) * (c_4*(c_4-1)/2);

    cout << ans << endl;

    return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:5: error: 'memset' was not declared in this scope
   11 |     memset(count,0,sizeof(count));
      |     ^~~~~~
a.cc:2:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    1 | #include <iostream>
  +++ |+#include <cstring>
    2 | using namespace std;
Language: C++

#include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int prime[25] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
    int count[25];

    memset(count,0,sizeof count);

    for(int i=1; i <= N; i++){
        for(int j=0; j<25; j++){
            int cur = i;
            int prime_tmp = prime[j];
            while (cur % prime_tmp == 0){
                cur /= prime_tmp;
                count[j] += 1;
            }
        }
    }

    int ans = 0;

    //1: 2*24 //
    int c_2 = 0;
    int c_24 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 24){c_24++;}
    }

    ans += (c_2-1) * c_24;

    //2: 2*4*4 //
    c_2 = 0;
    int c_4 = 0;
    for(int j=0; j<25; j++){
        if(count[j] > 2){c_2++;}
        if(count[j] > 4){c_4++;}
    }

    ans += (c_2-2) * (c_4*(c_4-1)/2);

    cout << ans << endl;

    return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:5: error: 'memset' was not declared in this scope
   11 |     memset(count,0,sizeof count);
      |     ^~~~~~
a.cc:2:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    1 | #include <iostream>
  +++ |+#include <cstring>
    2 | using namespace std;