akhauriyash/Code-Regression huggingface dataset:
#include <bits/stdc++.h>
#define N 100010
#define pb push_back
#define fi first
#define se second
#define si size()
#define ll long long
#define mp make_pair
#define iter ::iterator
#define all(v) v.begin(), v.end()
#define READ(f) freopen (f, "r", stdin)
#define WRITE(f) freopen (f, "w", stdout)
#define pp pop_back
#define mapiter map<int, int>::iterator
#define pii pair<int, int>
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forn1(i, n) for(int i = 0; i <= n; ++i)
#define forr(i, x, n) for(int i = x; i <= n; ++i)
#define r0 return 0
#define barnarnar ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define lld long double
  
const int inf = 1e9 + 1;
const ll modw = 1e9 + 7;
  
using namespace std;



int main() {
    barnarnar
	int a, b;
	cin >> a >> b;
	cout << 6 - a - b;
    return 0;
}















Measured memory_bytes: 256
#include <iostream>
#include <string>
#include <vector>
#include <tuple>
#include <algorithm>
using namespace std;
typedef long long ll;

int main(void){
    int n, a[55][26];
    string s;
    cin >> n;
    for (int i = 0; i < 26; i++) {
        for (int j = 0; j < n; j++) a[j][i] = 0;
    }
    
    for (int i = 0; i < n; i++) {
        cin >> s;
        for (int j = 0; j < s.size(); j++) {
            a[i][char(s[j]) - 'a']++;
            //cout << a[i][char(s[j]) - 'a'] << endl;
        }
    }
    
    for (int i = 0; i < 26; i++) {
        int mn = 100;
        for (int j = 0; j < n; j++) {
            mn = min(mn, a[j][i]);
        }
        for (int j = 0; j < mn; j++) cout << char(i + 'a');
    }
    cout << endl;
    
    
}


Measured memory_bytes: 256
#include <stdio.h>

int main(void)
{
	int cup[3] = {1, 0, 0};
	char a, b;
	int i;
	
	while (scanf(" %c,%c", &a, &b) != EOF){
		int tmp = cup[a - 'A'];
		cup[a - 'A'] = cup[b - 'A'];
		cup[b - 'A'] = tmp;
	}
	for (i = 0; i < 3; i++){
		if (cup[i] == 1){
			printf("%c\n", i + 'A');
			break;
		}
	}
	
	return 0;
}

Measured memory_bytes: 540
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

using ll = long long;
using P = std::pair<ll, ll>;

constexpr ll INF = 1ll<<60;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }

template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }

ll N, M;
ll A[310][310];
std::set<ll> S;
ll ans = INF;

int main()
{
  std::cin >> N >> M;

  rep( i, N ) rep( j, M )
    std::cin >> A[i][j], --A[i][j];

  rep( i, M )
    S.emplace( i );

  while( !S.empty() )
  {
    std::map<ll, ll> cnt;

    rep( i, N )
    {
      rep( j, M ) if( S.count(A[i][j]) )
      {
        ++cnt[A[i][j]];

        break;
      }
    }

    ll Q = 0, P = -1;

    itr( it, cnt )
    {
      if( chmax( Q, it->second ) )
        P = it->first;
    }

    chmin( ans, Q );

    S.erase( S.find(P) );
  }

  std::cout << ans << std::endl;

  return 0;
}

Measured memory_bytes: 1024
// Mon Aug 24 16:24:09 IST 2020        
#include <bits/stdc++.h>        
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b)       for(int ii = (int)a ; ii < (int)b  ; ii++ )
#define scan(any)          for(auto &i:any) cin>>i;
#define debug(x)           cerr << #x << " " << x << " -- \n"
#define I__O               ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define int64              long long   
#define all(x)             (x).begin(),(x).end() 
#define ff                 first
#define ss                 second
#define pppp               pair <int,int> 
#define flushOff           fflush(stdout) 
#define precise(x)         cout << fixed << setprecision(12) << x << '\n'; 
using namespace std ;    
// policy based   
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set ; 
 
const int MOD1 = 1e9+7;
const int MOD2 = 1e9+9;
const double pi = 3.141592653589793238;
const int INF = 2e9+7; 
// const int N = 2e5+7;
struct compare{
    bool operator()(pair <int,int> A, pair <int,int> B){
        if(A.first == B.first)
            return A.second > B.second;
        return A.first > B.first;
    }
}; 
void print(vector <int>v){
    for(int t : v){
        cout << t << ' ';
    }
    cout << '\n';
} 
int tests(){ 
    int A,B;
    cin >> A >> B;
    if(A > B)
        swap(A,B);
    if((B-A)&1)
        return cout << "IMPOSSIBLE\n",0;
    cout << A + (B-A)/2 << '\n';
    return 0;
}    
int main(){
    I__O ;      
    int cases = 1 ;  
    // cin >> cases ;
    while(cases--)
        tests(); 
    return 0 ; 
}
 


Measured memory_bytes: 3608
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#define int long long
using namespace std;

signed main() {
	int a, b;
	while (cin >> a >> b, a | b) {
		for (int c = 0; c < a; c++) {
			for(int d=0;d<b;d++)cout<<"#";
			cout << endl;
		}
		cout << endl;
	}
}

Measured memory_bytes: 3048
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll h,w,d,a;cin>>h>>w>>d;
  map<ll,P> m;
  rep(i,h)rep(j,w) {cin>>a;m[a]=P(i+1,j+1);}
  lvector c(h*w+1,0);
  for(ll i=d+1;i<=h*w;++i) c[i]=c[i-d]+abs(m[i].first-m[i-d].first)+abs(m[i].second-m[i-d].second);
  ll q,l,r;cin>>q;
  rep(i,q) {
    cin>>l>>r;
    print(c[r]-c[l]);
  }
  return 0;
}


Measured memory_bytes: 9524
x = int(input())
a = 0
b = 0
while a ** 5 - b ** 5 != x and a ** 5 + b ** 5 != x:
    B = a ** 5 - x
    b = int(abs(B ** (1/5)))
    if a ** 5 - b ** 5 == x or a ** 5 + b ** 5 == x:
        break

    a += 1

if a ** 5 - b ** 5 == x:
    print(a, b)
else:
    print(a, -1 * b)

Measured memory_bytes: 62652
#include<bits/stdc++.h>
using namespace std;

int main(){
	int n;cin>>n;
	vector<double> dp(n+1,0);
	dp[0]=1;
	for(int i=1;i<=n;i++){
		double k;cin>>k;
		for(int j=i;j>=0;j--){
			dp[j]=(i==0?0:dp[j-1]*k) + dp[j]*(1-k);
		}
	}
	double s=0;
	for(int i=n/2+1;i<=n;i++) s+=dp[i];
		printf("%.10lf\n",s);
}

Measured memory_bytes: 3788
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
 
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
#define v edge[i].to
#define mp(a, b) make_pair(a, b)
 
using namespace std;

const int N = 510;

char p[N];
int r[N][N], b[N][N];

int main()
{
	int h, w;
	scanf("%d%d", &h, &w);
	Rep(i, h) {
		scanf("%s", p + 1);
		Rep(j, w) if (p[j] == '#') r[i][j] = b[i][j] = 1;
	}
	Rep(i, w) r[1][i] = b[h][i] = 1;
	Rep(i, h) Rep(j, w) {
		if (j & 1) r[i][j] = (i != h);
		else b[i][j] = (i != 1);
	}
	
	Rep(i, h){
		Rep(j, w) printf("%c", r[i][j] ? '#' : '.');
		printf("\n");
	}
	printf("\n");
	Rep(i, h){
		Rep(j, w) printf("%c", b[i][j] ? '#' : '.');
		printf("\n");
	}
	
	
	
	return 0;
}

Measured memory_bytes: 2688
#include<bits/stdc++.h>
using namespace std;
template<typename T>
inline void read(T &x)
{
	x=0;
	int f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
}
	while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
	x*=f;
	return;
}	
template<typename T>
void write(T x)
{
	if(x<0) putchar('-'),x=-x;
	if(x>=10) write(x/10);
	putchar(x%10+'0');
	return;
}
int a,b,c;
int main()
{
    cin>>a>>b>>c;
    if(a==b&&a!=c) cout<<"Yes"<<endl;
    else if(a!=b&&b==c) cout<<"Yes"<<endl;
    else if(a==c&&a!=b) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
	return 0;
}


Measured memory_bytes: 256
import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int d = sc.nextInt();
		int e = sc.nextInt();
		
		int s,t,u,x,y,z,min;
		s = a + d - 50;
		t = b + d - 50;
		u = c + d - 50;
		x = a + e - 50;
		y = b + e - 50;
		z = c + e - 50;
		
		min = s;
		if(min > t){
			min = t;
		}if(min > u){
			min = u;
		}if(min > x){
			min = x;
		}if(min > y){
			min = y;
		}if(min > z){
			min = z;
		}
		
		System.out.println(min);

	}

}

Measured memory_bytes: 17356
import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

string my_readln() { return chomp(readln()); }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = my_readln.to!long;

	ulong[32] d;
	foreach (i; 0..32)
	{
		auto x = N % 2;
		//stderr.writeln(N, " ", x);
		N /= 2;
		long sign;
		if (i % 2 == 0) sign = 1;
		else			sign = -1;
		if (sign * sgn(x) >= 0)
		{
			d[i] += abs(x);
		}
		else
		{
			++d[i+1];
			++d[i];
		}
		while (d[i] > 1)
		{
			++d[i+2];
			++d[i+1];
			d[i] -= 2;
		}
	}

	string ans;
	bool hasStart = false;
	foreach_reverse (e; d)
	{
		if (hasStart)
		{
			ans ~= e.to!string;
		}
		else if (e == 1)
		{
			ans ~= e.to!string;
			hasStart = true;
		}
	}
	if (!hasStart) ans ~= "0";

	writeln(ans);
	stdout.flush();
}

Measured memory_bytes: 256
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b){
    ll g = gcd(a, b);
    return a / g * b;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll a, b, c, d;
	cin >> a >> b >> c >> d;
	--a;
	ll lc = lcm(c, d);
	ll ans = (b - b/c - b/d + b/lc) - (a - a/c - a/d + a/lc);
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 256