akhauriyash/Code-Regression huggingface dataset:
#include <bits/stdc++.h>
using namespace std;
#define PI 3.1415926535
const long long int MOD = 998244353;
#define pb push_back
#define mp make_pair
#define fill(a)  memset(a, 0, sizeof (a))
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
#define watch(x) cout << (#x) << " is " << (x) << endl;
const long long int MAXX = 2e5+5;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector< iii > viii;

ll lcm(ll a, ll b) {
   return a / __gcd(a, b) * b;
}
int XOR(int x, int y){
  return (x | y) & (~x | ~y);
}
bool cmp(const pair<int,int> &a,const pair<int,int> &b) {
    return (a.second < b.second);
}
// bool isl = binary_search(x.begin(), x.end(), 5);
// __builtin_popcount(x)  - Returns the number of set bits in x
const long long int N = 1e7;
int binsearch(int lo, int hi){
    while(lo<hi){
        int mid=(lo+hi)/2;
        if((mid))   // check(mid)
            hi=mid;
        else
            lo=mid+1;
    }
    return lo;
}
int power(int x,int y){
    int res=1;
    while(y>0){
      if(y&1) res=((res*x));

      y/=2;
      x=((x*x));
    }
    return res;
}

int main(){
    FAST  
    int a,b,c;
    cin>>a>>b>>c;
    int k;
    cin>>k;
    int moves=0;
    while(b<=a){
        b*=2;
        moves++;
    }
    while(c<=b){
        c*=2;
        moves++;
    }
    if(moves<=k) cout<<"Yes";
    else cout<<"No";
    return 0;
}


Measured memory_bytes: 3644
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

int main(){
  int i,a,b,c,con=0;
  while(1){
    cin >> a >> b;
    if(a == 0 && b == 0) break;
    if(con != 0) cout << endl;

    c = 0;
    for(i=a;i<=b;i++){
      if(i%400 == 0){
	c++;
	cout << i << endl;
      }
      else if(i%100 == 0) continue;
      else if(i%4 == 0){
	c++;
	cout << i << endl;
      }
    }

    if(c == 0) cout << "NA" << endl;
    con++;
  }
  return 0;
}

Measured memory_bytes: 0
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
	int n;
	cin >> n;
	ll ans = 0;
	for(int i = 1; i <= (n - 1)/2; i++){
	  ans += n - i;
	  ans += i;
	}
	if(n % 2 == 0){
		ans += n/2;
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 256
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void solve(int n, int m) {
    VI a(n), b(m);
    REP(i, n) cin >> a[i];
    REP(i, m) cin >> b[i];
    SORT(a); SORT(b);
    int asum = accumulate(ALL(a), 0);
    int bsum = accumulate(ALL(b), 0);
    vector<tuple<int, int, int>> v;
    REP(i, n) REP(j, m) {
        int ab = asum, bb = bsum;
        if (ab - a[i] + b[j] == bb - b[j] + a[i]) {
            v.EB(make_tuple(a[i] + b[j], a[i], b[j]));
        }
    }
    SORT(v);
    int i, j, k;
    if (v.size() == 0) {
        cout << -1 << endl;
        return;
    }
    tie(i, j, k) = v.front();
    cout << j << " " << k << endl;
    return;
}

int main(void) {
    int n, p, m;
    string s;
    int a, b, c;
    while (cin >> n >> m) {
        if (n == 0 && m == 0) return 0;
        solve(n, m);
        //return 0;
    }
}

Measured memory_bytes: 3288