akhauriyash/Code-Regression huggingface dataset:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)

#define DEBUG(x) cout<<#x<<": "<<(x)<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()

template<typename T> inline void CHMAX(T& a, const T b) {if(a<b) a=b;}
template<typename T> inline void CHMIN(T& a, const T b) {if(a>b) a=b;}

constexpr ll MOD=1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout<<setprecision(10)<<fixed;
	double w, h, x, y;
	cin>>w>>h>>x>>y;
	cout<<w*h/2<<' '<<((x==w/2 && y==h/2) ? 1 : 0)<<'\n';
	return 0;
}


Measured memory_bytes: 256
# Recursion / Divide and Conquer - Merge Sort
def merge(A,left,mid,right):
    global c
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [10**9+1]
    R = A[mid:right] + [10**9+1]
    i,j = 0,0
    for k in range(left,right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
    c += right - left
def mergeSort(A,left,right):
    if left + 1 < right:
        mid = (left + right) // 2
        mergeSort(A,left,mid)
        mergeSort(A,mid,right)
        merge(A,left,mid,right)
        return A

n = int(input())
S = list(map(int, input().split()))
c=0
mergeSort(S,0,n)
print(*S)
print(c)
c=0


Measured memory_bytes: 63788
// include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>

using namespace std;

// func
// ------------------------------------------------
int CalcSumOfDigit(int n);      // 各桁の和を計算する。

// define
// ------------------------------------------------
#define all(a)        (a).begin(),(a).end()
#define pb            push_back
#define sz(a)         int((a).size())
#define rep(i,n)      for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n)     for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v)      sort((v).begin(),(v).end())

// code
// ------------------------------------------------
int main() {
 int a,b,c;
  cin >> a >> b >> c;
  if(a + b >= c) cout << "Yes" << endl;
  else cout << "No" << endl;
  
  return 0;
}

// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n)
{
  int s = 0;
  while(n)
  {
    s += n % 10;
    n = n / 10;
  }
  return s;
}

Measured memory_bytes: 256
pragma(inline, true)
void chmin(T)(ref T a, T b) {
    if (a > b) a = b;
}

int[] init() {
    enum INF = 1 << 28;
    int[] dp = new int[100010];
    foreach (i; 1..100001) {
        dp[i] = INF;
        int p6 = 1, p9 = 1;
        while (p6 <= i || p9 <= i) {
            if (i - p6 >= 0)
                chmin(dp[i], dp[i - p6] + 1);
            if (i - p9 >= 0)
                chmin(dp[i], dp[i - p9] + 1);
            p6 *= 6; p9 *= 9;
        }
    }
    return dp;
}
void main() {
    import std.conv : to;
    import std.stdio : readln, writeln;
    import std.string : chomp;
    enum dp = init();
    writeln(dp[readln.chomp.to!int]);
}

Measured memory_bytes: 2684
#include <iostream>

int main() {
	int a, b, c;
	std::cin >> a >> b;
	c = a*b;
		if (c % 2 == 0) {
			std::cout << "Even" << std::endl;
		}
		else {
			std::cout << "Odd" << std::endl;
		}
}

Measured memory_bytes: 256