akhauriyash/Code-Regression huggingface dataset:
#include<bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.141592653589793238462643383279502884L
#define make_unique(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#define Sort(vec) sort(vec.begin(),vec.end())
#define RSort(vec) sort(vec.rbegin(),vec.rend())
#define endl "\n"
#define tr1(i) cout<<i<<endl;
#define tr2(i,j) cout<<i<<" "<<j<<endl;
#define tr3(i,j,k) cout<<i<<" "<<j<<" "<<k<<endl;
#define vvi vector<vector<int> > 
#define vvl vector<vector<ll> >
#define all(st) st.begin(),st.end()
#define vpl vector<pair<ll,ll> >
#define vpi vector<pair<int,int> >
#define pi pair<int,int>
#define pl pair<ll,ll>
#define al vector<list<int> >
#define vs vector<string>
#define vb vector<bool>
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define rep(i,l,r) for(int i=l;i<r;i++)
#define repit(st) for(auto it=st.begin();it!=st.end();it++)
#define ull unsigned long long int
#define eb emplace_back
#define pb push_back
#define ll long long int
#define minf -(1e18)
#define inf 1e18
#define f first
#define se second
#define mod 1000000007
#define mx 200000
using namespace std;
ll mi(ll n,ll m){ll pw=n%m;ll ex=m-2;ll ans=1;while(ex){if(ex&1) ans = ans*pw%m;pw = pw*pw%m;ex>>=1;}return ans%mod;}
ll pw(ll a,ll n){ll pw=a%mod;ll ex=n;ll ans=1;while(ex){if(ex&1) ans = ans*pw%mod;pw = pw*pw%mod;ex>>=1;}return ans%mod;}
template<typename T>istream &operator>>(istream &is, vector<T> &v) { for (T &t : v) is >> t; return is; }
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &t : v) {os << t <<" ";} os << '\n'; return os; }
void show(ll x){cout<<x<<" ";}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
ll Abs(ll x){return x>0?x:(-x);}
ll Ceil(ll a,ll b){return a/b+(a%b!=0);}
#define bs binary_search
#define lb lower_bound
#define ub upper_bound
#define mkp make_pair
//#define d double
ll seg[4*mx];
ll query(ll index,ll l,ll r,ll ql,ll qr){
	if(ql>r || qr<l) return INT_MIN;
	if(ql<=l && qr>=r) return seg[index];
	ll mid=l+(r-l)/2;
	ll left=query(2*index,l,mid,ql,qr);
	ll right=query(2*index+1,mid+1,r,ql,qr);
	return max(left,right);
}
void update(ll index,ll l,ll r,ll i,ll val){
	if(i<l || i>r) return;
	if(l==r){
		seg[index]=val;
		return;
	}
	ll mid=l+(r-l)/2;
	update(2*index,l,mid,i,val);
	update(2*index+1,mid+1,r,i,val);
	seg[index]=max(seg[2*index],seg[2*index+1]);
}
void solve(){
	ll n;
	cin>>n;
	vl h(n),a(n);
	cin>>h;
	cin>>a;
	//dp[i]->max beauty sofar with height i....
	vl dp(n+1);
	for(ll i=0;i<n;i++){
		dp[h[i]]=query(1,0,n,0,h[i]-1)+a[i];
		update(1,0,n,h[i],dp[h[i]]);
		//cout<<dp[h[i]]<<endl;
	}
	ll ans=0;
	for(ll i=0;i<=n;i++) ans=max(ans,dp[i]);
	cout<<ans<<endl;
 
}
int32_t main(){
int t=1;
//cin>>t;
while(t--){
	solve();
}
}

Measured memory_bytes: 11136
//#define		FILE_INPUT_DEFINE
#ifdef		FILE_INPUT_DEFINE
#include	<fstream>
#endif		// FILE_INPUT_DEFINE

#include	<iostream>

using namespace std;

#define		MAX			45

int main()
{
#ifdef		FILE_INPUT_DEFINE
	// input from txt
	std::ifstream in(R"(C:\Temp\input.txt)");
	std::cin.rdbuf(in.rdbuf());
#endif		// FILE_INPUT_DEFINE

	unsigned int		fib[MAX] = { 1, 1 };

	for (int i = 2; i < MAX; ++i)
	{
		fib[i] = fib[i - 1] + fib[i - 2];
	}

	int		n;
	cin >> n;

	cout << fib[n] << "\n";

	return 0;
}

Measured memory_bytes: 3072
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

vector<vector<int> > mat(10, vector<int>(10));

inline int digit(int a, int b, int c, int d){
  return mat[mat[mat[mat[0][a]][b]][c]][d];
}

int main(){
  rep(i,10) rep(j,10) scanf("%d", &mat[i][j]);
  int res=0;
  rep(a,10)rep(b,10)rep(c,10)rep(d,10){
    int cnt=0;
    int dig = digit(a,b,c,d);

    rep(j,10) if(j!=a){
      if(mat[digit(j,b,c,d)][dig]==0) cnt++;
    }
    rep(j,10) if(j!=b){
      if(mat[digit(a,j,c,d)][dig]==0) cnt++;
    }
    rep(j,10) if(j!=c){
      if(mat[digit(a,b,j,d)][dig]==0) cnt++;
    }
    rep(j,10) if(j!=d){
      if(mat[digit(a,b,c,j)][dig]==0) cnt++;
    }
    rep(j,10) if(j!=dig){
      if(mat[dig][j]==0) cnt++;
    }
    if(a!=b && mat[digit(b,a,c,d)][dig]==0) cnt++;
    if(c!=b && mat[digit(a,c,b,d)][dig]==0) cnt++;
    if(c!=d && mat[digit(a,b,d,c)][dig]==0) cnt++;
    if(dig!=d && mat[digit(a,b,c,dig)][d]==0) cnt++;

    if(cnt>0) res++;
  }

  cout<<res<<endl;

  return 0;
}

Measured memory_bytes: 3264
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const int N = 1e3 + 5;
#define int long long int

int32_t main() {
    IOS ;
    // int t ; cin >> t ; while(t--) {}
    int n ; cin >> n ; int arr[n] ; 
    cin >> arr[0] ; 
    int mx = arr[0], cnt = 0 ; 
    for(int i=1; i<n; i++) {
        cin >> arr[i] ; 
        mx = max(mx, arr[i]) ;
        cnt += (mx- arr[i]) ;
    }
    
    cout << cnt ;
    return 0 ;
}


Measured memory_bytes: 5184
#include<stdio.h>
#include<math.h>
int main()
{
    // Akif Islam
    // Challenged by Sagor Kola :p
    int money;
    scanf("%d",&money);

    int n = money;

    int x,y;
    x = money%10;
    money = money/10;
    y = money%10;

    int last_total;
    last_total = y*10+x;
    //printf("Last 2 Digits : %d\n",last_total);


    double check;
    check = ceil(last_total/5.00);
    //printf("No of Yen needed = %.0lf\n",check);

    if((check*100)<=n) printf("1\n");
    else printf("0\n");


}


Measured memory_bytes: 128
#include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef vector<vector<int>> v2int;
typedef vector<ll> vll;
typedef vector<vector<ll>> v2ll;
typedef list<int> liint;
typedef pair<int, int> pint;
const int INF = int(2e9);
const ll LINF = ll(2e9) * ll(2e9);
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b) { a > b ? : a = b; }
template<class T, class C> void chmin(T& a, C b) { a < b ? : a = b; }
void verify(const deque<ll>& c_ans, int N, int K) {
    deque<ll> ans(c_ans.begin(), c_ans.end());
    rep(i, K) {
        auto it = max_element(ans.begin(), ans.end());
        ans[distance(ans.begin(), it)] = *it - N;
        rep(j, N) {
            if (j == distance(ans.begin(), it)) continue;
            ans[j]++;
        }

        rep(j, N) {
            cout << ans[j] << " ";
        }
        cout << endl;
    }

}
void solve(ll K, int N) {
    ll maxA = (ll(N) - 1) + K / N;
    ll t = K % N;
    //if (t != 0) maxA++;
    deque<ll> ans(N);
    rep(i, N) {
        ans[i] = maxA - i;
    }
    rep(i, t) {
        ll x = ans.back() + N;
        ans.pop_back();
        rep(j, ans.size()) ans[j]--;
        ans.push_front(x);
    }
    //verify(ans, N, K);
    cout << N << endl;
    rep(i, N) {
        cout << ans[i] << " ";
    }
    cout << endl;
}



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll K;
    cin >> K;
    int N = 50;
    if (K < 50) {
        N = K;
    }
    if (N == 0) {
        cout << 2 << endl;
        cout << 1 << " " << 1 << endl;
        return 0;
    }
    if (N == 1) {
        cout << 3 << endl;
        cout << 1 << " " << 0 << " " << 3 << endl;
        return 0;
    }

    solve(K, N);
    return 0;
}

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

struct Benri { Benri() { std::cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12);}} benri;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using ull = unsigned long long;

template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second

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

//constexpr long long MOD = 1000000007;
constexpr long long MOD = 998244353;
//constexpr int INF = 1001001001;
constexpr ll INF = 1001001001001001001ll;
constexpr double EPS = 1e-10;
using number = long long;


number GCD(number a, number b) {
    return b != 0 ? GCD(b, a % b) : a;
}
number LCM(number a, number b) {
    return a * (b / GCD(a, b));
}

int main() {
    ll n, x; cin >> n >> x;
    ll a = x, b = n - x;
    if (a > b) swap(a, b);
    ll ans = n;
    while (1) {
        if (b % a == 0) {
            ans += (2 * (b / a) - 1) * a;
            break;
        }
        else {
            ans += 2 * (b / a) * a;
            ll tmp = a;
            a = b % a;
            b = tmp;
        }
    }
    cout << ans << endl;
}

Measured memory_bytes: 256
#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define f(i,a,b,c) for(ll i=a;i<b;i+=c)
#define r(i,a,b,c) for(ll i=a;i>=b;i-=c)
int main(){
  string s,t; cin >> s >> t;
  ll a=1000; 
  f(i,0,s.size()-t.size()+1,1) { 
      ll l = 0; 
      f(j,0,t.size(),1) { 
          if (t[j] != s[i+j])
              l++;
        }
    a=min(l,a);
	}
  cout<<a;
  return 0;
}

Measured memory_bytes: 3624
#include<bits/stdc++.h>
using namespace std;
int main()
{
	string s;
	cin>>s;
	vector<char> vec;
	for(int i=0;i<s.length();i++)
	{
		if(s[i]=='0'||s[i]=='1')vec.push_back(s[i]);
		else if(s[i]=='B'&&vec.size()>=1)vec.pop_back();

	}
	for(int i=0;i<vec.size();i++)cout<<vec[i];
}

Measured memory_bytes: 256
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();


		int[] A = new int[N];
		int sum = 0;

		for(int i=0; i<N;i++) {
			A[i] = sc.nextInt();
			sum += A[i];
		}

		Arrays.sort(A);


		Double ts = (double)1 / (double)(4*M) * (double)sum ;

		for(int i=N-1; i>=N-M; i--) {
			if(ts > A[i]) {
				System.out.println("No");
				sc.close();
				return;
			}
		}


		System.out.println("Yes");
		sc.close();

	}
}

Measured memory_bytes: 24916
#include <iostream>
#include <string>
#include <cstring>
using namespace std;

int main(){
  string s; cin >> s;

  int al[26];
  memset(al, 0, sizeof(al));

  for(int i=0; i<s.length(); i++){
    al[s[i]-'a']++;
  }

  string ans="None";
  for(int i=0; i<26; i++){
    if(al[i]==0){
      ans = 'a'+i;
      break;
    }
  }

  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 512
#include <stdio.h>
 int main(){
   int n;
     scanf("%d",&n);
      int i;
      int syakkinn = 100000;
       for(i=0;i<n;i++){
        syakkinn *= 1.05;
        int n = syakkinn%1000;
		if(n != 0){
         syakkinn = syakkinn-n+1000;
		}
          }
           printf("%d\n",syakkinn);
		   scanf("%d",&n);
return 0;
}

Measured memory_bytes: 592
import java.util.Scanner;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		String s=sc.next();
		long k=sc.nextLong();
		for(int i=0; i<s.length(); i++){
			if(s.charAt(i)!='1'){
				System.out.println(s.charAt(i));
				return;
			}else{
				if(k==i+1){
					System.out.println("1");
					return;
				}
			}
		}
	}
}


Measured memory_bytes: 21844
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
#include<algorithm>
using namespace std;
#define long long LL     
#define MAXN=1e4+10    

char s[100010];
int main(){
	cin>>s;
	int l;
	l=strlen(s);
	int ans=0;
	for(int i=0;i<l-1;i++){
		if(s[i] != s[i+1]) ans++;
	}
	cout<<ans<<endl;
	
	return 0;
}

Measured memory_bytes: 384
#include <iostream>

using namespace std;

int main() {
    long long N, K;
    cin >> N >> K;

    long long sum = 0;

    for (long long i = K; i <= N + 1; ++i) {
        sum += N * i - i * i + i + 1;
        sum %= 1000000007;
    }

    cout << sum << endl;

    return 0;
}

Measured memory_bytes: 3636
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <queue>
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)++)

class MyList {
private:
    const int MAX_N = 2000000;
    int *lst = new int[MAX_N];
    int first = MAX_N - 1;
    int last = MAX_N - 1;
public:
    MyList();
    void insert(int x);
    void remove(int x);
    void deleteFirst();
    void deleteLast();
    int size();
    void print();
};

MyList::MyList() {
    //REP(i,MAX_N) lst[i] = -1;
}

void MyList::insert(int x) {
    lst[first] = x;
    first--;
}

void MyList::deleteLast() {
    last--;
}

void MyList::deleteFirst() {
    first++;
}

int MyList::size() {
    return last - first;
}

void MyList::remove(int x) {
    int xpos = -1;
    for(int i = first+1; i <= last; i++) {
        if (lst[i] == x) {
            xpos = i;
            break;
        }
    }
    if (xpos == -1) return;
    else {
        for(int i = xpos; i > first+1; i--) {
            lst[i] = lst[i-1];
        }
        first++;
    }
}

void MyList::print() {
    for(int i = first+1; i < last; i++) {
        cout << lst[i] << " ";
    }
    cout << lst[last] << endl;
}

int main() {
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    MyList mylist;
    REP(i,n) {
        string s;
        cin >> s;
        if (s == "insert") {
            int k;
            cin >> k;
            mylist.insert(k);
        }else if (s == "deleteFirst") {
            mylist.deleteFirst();
        }else if (s == "deleteLast"){
            mylist.deleteLast();
        }else {
            int k;
            cin >> k;
            mylist.remove(k);
        }
        //mylist.print();
    }
    mylist.print();
    return 0;
}

Measured memory_bytes: 7096
#include<iostream>
#include<complex>
#include <algorithm>
using namespace std;
int main()
{
    int r[4]={0},i,n;
    string s;
    cin >> n;
    for(i=0;i<n;i++){
      cin >> s;
      switch (s[0]){
        case 'A':
          r[0]++;
          break;
        case 'W':
          r[1]++;
          break;
        case 'T':
          r[2]++;
          break;
        case 'R':
          r[3]++;
          break;
      }
    }
    cout << "AC x " << r[0] << "\nWA x " << r[1] << "\nTLE x " << r[2] << "\nRE x " << r[3];
    return 0;
}

Measured memory_bytes: 3624
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;

typedef pair<int, int> P;
typedef pair<long long, long long> LLP;

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

    int ans = 0;

    for (int l1 = 0; l1 < N; l1++) {
        string T = S.substr(l1);
        vector<int> Z(T.length(), 0);
        Z[0] = T.length();
        int i = 1;
        int j = 0;
        while (i < T.length()) {
            while (i + j < T.length() && T[j] == T[i + j]) j++;
            Z[i] = j;
            if (j == 0) {
                i++;
                continue;
            }
            int k = 1;
            while (k < j && k + Z[k] < Z[i]) {
                Z[i + k] = Z[k];
                k++;
            }
            i += k;
            j -= k;
        }
        for (int i = 1; i < T.length(); i++) {
            ans = max(ans, min(Z[i], i));
        }
    }

    cout << ans << endl;

    return 0;
}

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

const int N = 100005, H = 10004;

int n, dp[N], h[N];

int main(){
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> h[i];
    h[0] = h[1];
    for(int i = 2; i <= n; i++)
        dp[i] = min(dp[i-1]+abs(h[i-1]-h[i]), dp[i-2]+abs(h[i-2]-h[i]));
    cout << dp[n] << "\n";
}

Measured memory_bytes: 1024
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;



int main() {
    ll h;
    cin >> h;

    cout << (1LL << 64-__builtin_clzll(h))-1 << endl;
}

Measured memory_bytes: 256
h1, a1, h2, a2 = map(int, input().split())
cnt1 = h2 // a1 if h2 % a1 == 0 else h2 // a1 + 1
cnt2 = h1 // a2 if h1 % a2 == 0 else h1 // a2 + 1
print('Yes' if cnt1 <= cnt2 else 'No')

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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;



int n;
ll freq[maxn];
int a[maxn];
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    cin>>n;
    for (int i=1; i<=n; i++) {
	cin>>a[i];
	freq[a[i]]++;
    }

    ll tot=0;
    for (int i=1; i<=n; i++) {
	tot += freq[i]*(freq[i]-1)/2;
    }

    for (int i=1; i<=n; i++) {
	tot -= freq[a[i]]*(freq[a[i]]-1)/2;
	freq[a[i]]--;
	tot += freq[a[i]]*(freq[a[i]]-1)/2;
	cout<<tot<<"\n";
	tot -= freq[a[i]]*(freq[a[i]]-1)/2;
	freq[a[i]]++;
	tot += freq[a[i]]*(freq[a[i]]-1)/2;
    }
  

    return 0;
}


Measured memory_bytes: 7552
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include<bits/stdc++.h>
#include <utility>

#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a); (b) <= i; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1)*(a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1<<29)

using namespace std;
using ll = long long;
map <int ,int> mpa,mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  string C1,C2;
  cin  >> C1 >> C2;
  bool flag=true;
  for(int i=0;i<3;i++){
    if(C1[i]!=C2[2-i]){
      flag=false;
    }
  }
  if(flag)cout <<"YES" << endl;
  else cout << "NO" << endl;
  return 0;
}

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

int main(int argc, char const *argv[])
{
	int a[3],k;
	cin>>a[0]>>a[1]>>a[2]>>k;
	sort(a,a+3);
	for (int i = 0; i < k; ++i)
	{
		a[2]*=2;
	}
	cout<<a[0]+a[1]+a[2]<<endl;
	return 0;
}


Measured memory_bytes: 256
import sys
sys.setrecursionlimit(10**8)
h, w = [int(i) for i in sys.stdin.readline().split()]
s_ls = []
bl_ls = []
for i in range(h):
    s = [1 if i == "#" else -1 for i in sys.stdin.readline().strip()]
    for j, k in enumerate(s):
        if k == 1:
            bl_ls.append((i, j))
    s_ls.append(s)

memo_ls = dict()
def dfs(y, x, col):
    if (y, x) in memo_ls:
        return memo_ls[(y, x)]
    res = 0
    if col == -1:
        res += 1
    already.add((y, x))
    for move_y, move_x in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
        next_y = y + move_y
        next_x = x + move_x
        if 0 <= next_x < w and 0 <= next_y < h and s_ls[next_y][next_x] == (-1) * col and (next_y, next_x) not in already:
            res += dfs(next_y, next_x, (-1) * col)
    return res

ans = 0
for bl in bl_ls:
    already = set()
    stack = [(bl[0], bl[1], 1, 0)]
    cnt = 0
    while len(stack) > 0:
        y, x, col, _sum = stack.pop(-1)
        if (y, x) in memo_ls:
            cnt = memo_ls[(y, x)]
            break
        if col == -1:
            cnt += 1
        already.add((y, x))
        for move_y, move_x in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
            next_y = y + move_y
            next_x = x + move_x
            if 0 <= next_x < w and 0 <= next_y < h and s_ls[next_y][next_x] == (-1) * col and (
            next_y, next_x) not in already:
                stack.append((next_y, next_x, (-1) * col, _sum))
                already.add((next_y, next_x))
    res = cnt
    ans += res
    for al in list(already):
        memo_ls[al] = res
print(ans)

Measured memory_bytes: 82780
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define vcout(v) rep(i,v.size()) cout << v[i] << " "; cout << endl
#define mcout(m) rep(j,m.size()){vcout(m[j]);}
const ll MOD = 1e9 + 7;

int mainsolve(){


	ll n; cin >> n;
	string alp = "abcdefghijklmnopqrstuvwxyz";
	
	function<deque<pair<string,char>>(ll)> dfs = [&](ll n){
		deque<pair<string,char>> res;
		
		if(n==1){
			res.push_back(make_pair("a",'a'));
		}
		else{
			
			res = dfs(n-1);
			ll sz = res.size();
			rep(i,sz){
				pair<string,char> now = res[0];
				res.pop_front();
				
				char c = now.second;
				rep(j,c-'a'+2){
					res.push_back(make_pair(now.first + alp[j],alp[max(j,(ll)now.second-'a')]));
				}
				
			}
			
			sort(res.begin(), res.end());
		}
		
		
		return res;
	};

	deque<pair<string,char>> res = dfs(n);
	rep(i,res.size()){
		cout << res[i].first << endl;
	}
	
	return 0;

	assert(false);
}

int main(){
	
	//ll TC;cin>>TC;rep(I,TC){cout<<"case:"<<I+1<<"---"<<endl; // comment out!
		mainsolve();
	//} // comment out!
	return 0;
}


Measured memory_bytes: 8832
#include <iostream>
#include <vector>
#include <string>

#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=a,i##_len=(b);i<i##_len;++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()

using namespace std;
using ll = long long;
typedef long long ll;

int gcd(int a,int b){return b?gcd(b,a%b):a;}

int main() {
    ll a, b, c;
    cin >> a >> b >> c;

    ll d = c - a - b;
    if (d < 0) {
        cout << "No" << '\n';
    } else if (4 * a * b < d * d) {
        cout << "Yes" << '\n';
    } else {
        cout << "No" << '\n';
    }


    return 0;
}


Measured memory_bytes: 888
#include <iostream>
using namespace std;

const int MAX_N = 110;
const int MAX_V = 100100;

long long dp[MAX_N][MAX_V] = {0};//N-1番目までで入れた容量の価値を最大にするもの
long long weight[MAX_N], value[MAX_V];
const long long INF = 1LL << 60;


int main(){
    long long N, W;
    cin >> N >> W;
    for(int i=0; i<N; ++i){
        cin >> weight[i] >> value[i];
    }
    for(int i=0; i< MAX_N; ++i){
        for(int j=0; j<MAX_V; ++j){
            dp[i][j] = INF;
        }
    }

    dp[0][0] = 0;

    for (int i = 0; i < N; ++i)
    {
        for(int sum_v = 0; sum_v < MAX_V; ++sum_v){
            //i番目の商品を選ぶ
            if(sum_v - value[i]>=0){
                if(dp[i+1][sum_v] > dp[i][sum_v - value[i]] + weight[i]){
                    dp[i+1][sum_v] = dp[i][sum_v - value[i]] + weight[i];
                }
            }

            if(dp[i+1][sum_v] > dp[i][sum_v]){
                    dp[i+1][sum_v] = dp[i][sum_v];
                }
        }
    }

    long long res = 0;
    for(int sum_v=0; sum_v < MAX_V; ++sum_v){
        if(dp[N][sum_v] <= W){
            res = sum_v;
        }
    }
    cout << res <<endl;

    return 0;
}

Measured memory_bytes: 86400
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

//long mod = 10^^9 + 7;
long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	
	long[] arr = [N];
	for (long i = 2; i*i <= N; ++i)
	{
		if (N % i == 0)
		{
			arr ~= i;
		}
	}
	auto x = arr[$-1];
	auto y = N / x;
	
	writeln(x+y-2);
	stdout.flush();
	debug readln();
}

Measured memory_bytes: 256
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ABC_A115
{
	class Program
	{
		static void Main(string[] args)
		{
			int D;

			D = int.Parse(Console.ReadLine());


			if (D == 25) 
				Console.Write("Christmas");
			else if (D == 24)
				Console.Write("Christmas Eve");
			else if (D == 23)
				Console.Write("Christmas Eve Eve");
			else if (D == 22)
				Console.Write("Christmas Eve Eve Eve");
			Console.ReadKey();

		}
	}
}


Measured memory_bytes: 11092
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] X = new int[N];
		for ( int n = 0 ; n < N ; n++ ) {
			X[n] = sc.nextInt();
		}

		int mind = Integer.MAX_VALUE;
		for ( int x = 1 ; x <= 100 ; x++ ) {
			int d = 0;
			for ( int n = 0 ; n < N ; n++ ) {
				d += (X[n] - x) * (X[n] - x);
			}
			mind = Math.min(d, mind);
		}
		System.out.println(mind);
	}
}


Measured memory_bytes: 22996
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
ll hell=pow(10,18);
void solve(){
	ll n,res=1;
	cin>>n;
	vector<ll> v(n);
	for(ll i=0;i<n;i++){
		cin>>v[i];
		if(v[i]==0){
			cout<<0;
			exit(0);
		}
	}
	for(ll i=0;i<n;i++){
		if(res*1.0>(1.0*hell/v[i])){
			res=(-1);
			break;
		}
		res*=v[i];
	}
	if(res>hell){
		cout<<"-1";
		exit(0);
	}
	cout<<res;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	ll qc=1;
    for(ll i=1;i<=qc;i++)
    solve();
}


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

int main(){
  int N,M;
  cin >> N>>M;
  vector<string> Ns(N);
  vector<string> Ms(M);
  for(int i = 0; i < N;i++){
    cin >> Ns.at(i);
  }
  for(int i = 0; i < M;i++){
    cin >> Ms.at(i);
  }
  
  for(int y = 0; y <= N-M;y++){
    for(int x = 0; x <= N-M;x++){
      //左上を決める
      bool ret = true;
      for(int Y = 0; Y < M;Y++){
	    for(int X = 0; X < M;X++){
			if(Ms.at(Y).at(X)!= Ns.at(y+Y).at(x+X)){
          	   ret = false;
         	   break;
         	}      
  		}
      }
      if(ret) {cout <<"Yes" ; return 0;}
  	}
  }
  
  cout << "No" ;
  return 0;
}


Measured memory_bytes: 256
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;

typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i = (m);i < (n);i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1;} return 0;}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////


int main() {
    int n; cin >> n;
    int rev = 0, h;
    rep(i,n) {
        cin >> h;
        if (rev+1 <= h) h--;

        if (rev > h) {
            cout << "No" << endl;
            return 0;
        }

        rev = h;
    }
    cout << "Yes" << endl;
    return 0;
}

Measured memory_bytes: 256
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template <typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
    for(auto &e:t) fill_v(e,v);
}
template<class T> bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1;}
    return 0;
}
template<class T> bool chmin(T & a, const T & b) { if (a > b) { a = b; return 1;}
    return 0;
}

double a, b, x;
bool check(double mid){
    static const double pi = 3.141592653589793;
    double m = mid * pi / 180.0;
    if(a*tan(m) <= b){
        if(x > a*a*(b - a*tan(m)/2.0))return false;
        return true;
    }else{
        if(x > a*b*b/tan(m) / 2.0)return false;
        return true;
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> a >> b >> x;
    double ok = 0;
    double ng = 90;
    while(ng-ok > 1e-12){
        double mid = (ng + ok)/2.0;
        if(check(mid))ok = mid;
        else ng = mid;
    }
    printf("%.10f\n",ok);
    return 0;
}

Measured memory_bytes: 4120
// https://atcoder.jp/contests/abc075/tasks/abc075_a
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    vector<int> v(3);
    REP(i, 3) cin >> v[i];
    sort(ALL(v));
    cout << (v[1] == v[0] ? v[2] : v[0]) << endl;

    return 0;
}


Measured memory_bytes: 256
#include <iostream>

using namespace std;

int main(void) {
    string S;
    cin >> S;

    bool a = false, b = false, c = false;
    for (int i = 0; i < 3; ++i) {
        if (S[i] == 'a') a = true;
        if (S[i] == 'b') b = true;
        if (S[i] == 'c') c = true;
    }

    if (a && b && c) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

Measured memory_bytes: 768
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define ALL(v) v.begin(), v.end()
typedef long long ll;



int main(){
    int n;cin>>n;
    string s;cin>>s;
    bool ans=false;
    if(n%2==0){
    for(int i=0;i<s.length()/2;i++){
        if(s[i]!=s[s.length()/2+i])ans=true;
    }
    if(ans)cout << "No" << endl;
    else cout << "Yes" << endl;
    }
    else cout <<"No"<<endl;
    
    return 0;
}





Measured memory_bytes: 256
i = input().split()
a = int(i[0])
b = int(i[1])
if a < 0 and b > 0:
	print("Zero")  
elif a < 0 and b < 0:
	tmp = (a*-1) - (b*-1) + 1
	if tmp % 2 == 0:
		print("Positive")
	else:
		print("Negative")
else:
	print("Positive")
        

Measured memory_bytes: 3060
#include <iostream>
#include <algorithm>
#define WMAX 100000
#define ESC_UNLIMITED 10001
using namespace std;

int main() {
  short a_list[WMAX], leftesc[WMAX] = {};
  int w;
  cin >> w;

  short esc_limit = 0;
  for (int i = 0; i < w; i++) {
    cin >> a_list[i];
    auto &a = a_list[i];
    if (a == 0) {
      esc_limit = ESC_UNLIMITED;
    } else if (esc_limit > 0) {
      if (a > 0) {
        leftesc[i] = min(a, esc_limit);
      } else {
        esc_limit = min(esc_limit, (short)-a);
      }
      if (esc_limit != ESC_UNLIMITED) esc_limit--;
    }
  }

  unsigned long r = 0;
  esc_limit = 0;
  for (int i = w - 1; i >= 0; i--) {
    auto& a = a_list[i];
    if (a == 0) {
      esc_limit = ESC_UNLIMITED;
    } else if (esc_limit > 0) {
      if (a > 0) {
        r += max(leftesc[i], min(a, esc_limit));
      } else {
        esc_limit = min(esc_limit, (short)-a);
      }
      if (esc_limit != ESC_UNLIMITED) esc_limit--;
    } else if (a > 0) {
      r += leftesc[i];
    }
  }

  cout << r << endl;
  return 0;
}

Measured memory_bytes: 1556
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define str string
#define vs vector<str>
#define vb vector<bool>
#define slli set<lli>
#define mii map<int, int>
#define mlli map<int, lli>
#define msi map<str, int>
#define mp make_pair
#define pii pair<int, int>
#define pll pair<lli, lli>
#define vpii vector<pii >
#define vpll vector<pll >
#define pb push_back
#define loop(i, s, l, j) for(int i = s; i < l; i += j)
#define rloop(i, s, l, j) for(int i = s; i >= l; i -= j)
#define rep(i, n) loop(i,0,n,1)
#define rrep(i, n) rloop(i,n-1,0,1) 
#define fastio() ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ft first
#define sd second   
#define mit mii::iterator
#define vit vi::iterator
#define all(a) a.begin(),a.end()
#define min3(a, b, c) min(a, min(b, c))
#define mod 1000000007
#define inf 100000000000000000
#define limit 200005
#define minval -100000000000000000
/**********************************************************************************************************************************************/
int dx4[4] = {0, -1, 0, 1};
int dy4[4] = {1, 0, -1, 0};
int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int Power(int base,int exp){int ans=1;  while(exp > 0){if(exp&1)ans=(1LL*ans*base)%mod; exp=exp>>1; base=(1LL*base*base)%mod;}  return ans;}
/**********************************************************************************************************************************************/ 

void input()
{
	int n;
	cin >> n;
	vi a(n);
	vi b(n);
	rep(i,n)
		cin >> a[i];
	rep(i,n)
		cin >> b[i];
	reverse(all(b));

	bool ok = 1;

	rep(i,n)
		if(a[i] == b[i])
		{
			ok = 0;
			break;
		}

	if(ok)
	{
		cout << "Yes\n";
		rep(i,n)
			cout << b[i] << ' ';
		cout << '\n';
		return;
	}


	int i1 = 0, i2 = 0;
	rep(i,n)
		if(a[i] == b[i])
		{
			i1 = i;
			break;
		}
	rep(i,n)
		if(a[i] == b[i])
			i2 = i;

	vi id;
	rep(i,n)
		if(b[i] != b[i1] && a[i] != b[i1])
			id.pb(i);

	if((int)id.size() == 0)
	{
		cout << "No\n";
		return;
	}

	int j = 0;
	loop(i,i1,i2+1,1)
	{
		swap(b[id[j]], b[i]);
		j++;
		if(j == (int)id.size())
			break;
	}


	rep(i,n)
		if(a[i] == b[i])
		{
			cout << "No\n";
			return;
		}
	cout << "Yes\n";
	rep(i,n)
		cout << b[i] << ' ';
	cout << '\n';


}

int main()
{
 
    fastio();
    int q = 1;
    //cin >> q;
    while(q--)
        input();
}

Measured memory_bytes: 5844
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pii pair<ll,ll>
#define vec vector<ll>
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define repd(i,a,b) for(ll i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define M 1000000007

using namespace std;


int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ll n; cin>>n;
	set< string>m;
	rep(i,0,n-1)
	{
		string s;
		cin>>s;
		m.insert(s);
	}
	cout<<m.size();
	return 0;
}

Measured memory_bytes: 19284
#include <stdio.h>

int main(void) {
	int a, b;
	scanf("%d %d", &a, &b);
	if ((a % 2 == 1) && (b % 2 == 1)) {
		printf("Odd\n");
	}
	else {
		printf("Even\n");
	}
	return 0;
}

Measured memory_bytes: 128
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("unroll-loops,rename-registers")
//#pragma GCC target("sse4,avx,avx2")

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <chrono>
#include <random>
#include <string>
#include <queue>
#include <tuple>
#include <unordered_map>
#include <sstream>
#include <numeric>
#include <complex>
#include <immintrin.h>
#include <unordered_set>

using namespace std;

using ll = long long;
using ld = long double;
using VectorType = ld;
using ull = unsigned long long;

const ll INF = 1e15;
const ld eps = 1e-7;
const ld pi = atan2(0, -1);
const ll mod = 1e9 + 7;
const ll P = 179, Q = 239;
const ll A = 26;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

ll sign(ll a) {
	if (a < 0) return -1;
	if (a == 0) return 0;
	return 1;
}

bool equal(ld a, ld b) {
	return abs(a - b) < eps;
}

struct query {
	ll l, r, i;

	query(ll l = 0, ll r = 0, ll i = 0) : l(l), r(r), i(i) {};
};

bool mini(ll &a, ll b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

bool maxi(ll &a, ll b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

bool mini(ld &a, ld b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

ll mmax(ll a, ll b) {
	if (a > b) return a;
	return b;
}

ll mmin(ll a, ll b) {
	if (a < b) return a;
	return b;
}

ld mmax(ld a, ld b) {
	if (a > b) return a;
	return b;
}

ld mmin(ld a, ld b) {
	if (a < b) return a;
	return b;
}

bool maxi(ld &a, ld b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

ll sub(ll a, ll b) {
	a -= b;
	if (a < 0) {
		a += mod;
	}
	return a;
}

ll add(ll a, ll b) {
	a += b;
	if (a > mod) {
		a -= mod;
	}
	return a;
}

ll mul(ll a, ll b) {
	return (a * b) % mod;
}

ll n, m;
ll k;
vector <vector <ll>> vec;
vector <bool> used;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll x;
	cin >> x;
	ll cur = 100;
	ll cnt = 0;
	while (cur < x) {
		cur = cur + cur / 100;
		cnt++;
	}
	cout << cnt;
	return 0;
}

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

// Data Type
#define ull     unsigned long long int
#define ll      long long int

// Loops
#define loop(i,s,e)     for(ll i=(s);i<(e);i++)
#define rloop(i,s,e)    for(ll i=(s);i>=(e);i--)

// Stl
#define pb      push_back
#define eb      emplace_back
#define pf      push_front
#define popb    pop_back
#define popf    pop_front
#define mp      make_pair
#define ff      first
#define ss      second

// Maths
#define PI          (2*acos(0.0))
#define gcd(a,b)    __gcd((a),(b))
#define lcm(a,b)    (((a)*(b))/(__gcd((a),(b))))
#define log(x,b)    (log(x)/log(b))
#define INF         LLONG_MAX

// Big data
const int Mod = 1e9+7;
#define mul(a,b)         ((a%Mod)*(b%Mod))%Mod
#define sum(a,b)         ((a%Mod)+(b%Mod))%Mod

// Bit-Manipulation
#define setbit(n,pos)       n |= (1LL<<pos)
#define resetbit(n,pos)     n &= (~(1LL<<pos))
#define toogle(n,pos)       n ^= (1LL<<pos)
#define atpos(n,pos)        ((n&(1LL<<pos))!=0)

// Extra
#define scan(any)       for(auto &i:any) cin>>i;
#define print(any)      for(auto i:any) cout<<i<<" "; nl;
#define nl              cout<<'\n'
#define endl            '\n'

void solve()
{
	ll n;
	cin>>n;
	string a,b;
	cin>>a>>b;

	loop(i,0,n)
		cout<<a[i]<<b[i];
}

int main()
{
	try
	{
		ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
		int t = 1; 
		while(t--)
			solve();
	}
    catch(...)
    {
    	// nothing.
    }
	return 0;
}
/*
greater<int>()
fill_n(array,size,value);
fill(start,end,value);
getline(cin,string);
cin.getline(char array,size);
LLONG_MAX
DBL_MAX
*/

Measured memory_bytes: 256
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int main()
{
  string str,t;cin>>str>>t;int c=0;
  for(int i=0;i<str.size();i++)
  {
      if(str[i]!=t[i])
        c++;
  }
  cout<<c<<"\n";
return 0;
}


Measured memory_bytes: 3848
package main

import (
        "fmt"
        "strconv"
)

func calc(n int) int {
        ns := fmt.Sprintf("%d", n)
        r := 0
        for _, v := range ns {
                c, _ := strconv.Atoi(fmt.Sprintf("%c", v))
                r += c
        }
        return r
}

func main() {
        n := 0
        a := 0
        b := 0
        fmt.Scan(&n, &a, &b)
        sum := 0
        for ii := 1; ii <= n; ii++ {
                d := calc(ii)
                if d >= a && d <= b {
                        sum += ii
                }
        }
        fmt.Println(sum)
}

Measured memory_bytes: 1024
import java.io.*;
import java.util.*;
public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
		String[] lo = reader.readLine().split(" ");
		int n = Integer.parseInt(lo[0]);
		double d = Double.parseDouble(lo[1]);
		int ans = 0;
		for(int i = 0;i<n;i++){
			String[] po = reader.readLine().split(" ");
			long x = Long.parseLong(po[0]);
			long y = Long.parseLong(po[1]);
			if(Math.sqrt(x*x+y*y) <=d) ans++;
		}
		System.out.println(ans);
	}
}

Measured memory_bytes: 55084
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;

int main() {
    ll X; cin >> X;
    ll now = 100;
    ll counter = 0;
    while(true){
        if (now >= X){
            cout << counter << endl;
            return 0;
        }
        now = now + (now / 100);
        counter++;
    }
}

Measured memory_bytes: 3624
def PoorOrNot(number_list):
  number_dict = {}
  for num in number_list:
    if num not in number_dict:
      number_dict[num] = 1
  if len(number_dict) == 2:
    return "Yes"
  else:
    return "No"
  
number_list = list(map(int, input().split()))
print (PoorOrNot(number_list))

Measured memory_bytes: 3064
def dfs(i, f):
    global ans
    if i == len(s) - 1:
        if eval(f) == 7:
            ans = f + "=7"
            return ans
        return 0
    dfs(i + 1, f + "+" + s[i+1])
    dfs(i + 1, f + "-" + s[i+1])
    
s = input()
ans = ""
dfs(0, s[0])
print(ans)

Measured memory_bytes: 3060
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))

passed = 0
for i in range(N):
    num = 0

    for j in range(M):
        num += A[i][j] * B[j]
    num += C

    if num > 0:
        passed += 1

print(passed)


Measured memory_bytes: 9196
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define END getchar();getchar();return 0
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1000000007
typedef pair<int, int> P;
char t[250000], d[250000];

signed main() {
	int n, q, ans = 0;
	cin >> n >> q;
	string s;
	cin >> s;
	for (int i = 0; i < q; i++) {
		cin >> t[i] >> d[i];
	}
	int a = s.size() - 1;
	for (int i = q - 1; i >= 0; i--) {
		if (d[i] == 'R'&&s[a]==t[i]){
			ans++;
			a--;
		}
		if (ans&&d[i] == 'L'&&t[i] == s[a+1]){
			ans--;
			a++;
		}
	}
	a = 0;
	n -= ans;
	ans = 0;
	for (int i = q - 1; i >= 0; i--) {
		if (d[i] == 'L'&&s[a]==t[i]){
			ans++;
			a++;
		}
		if (ans&&d[i] == 'R'&&t[i] == s[a-1]){
			ans--;
			a--;
		}
	}
	cout << n - ans << endl;

	END; 
}


Measured memory_bytes: 1028
#include<bits/stdc++.h>
#define rep(i, n) for(int (i)=0 ;i <(n); ++(i))
#define REP(i,m,n) for(int (i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)? "YES":"NO")
typedef long long ll;
using namespace std;

int main() {
  int a, b, c;
  cin >> a >> b >> c;
  cout << a*b/2 << endl;
  return 0;
}


Measured memory_bytes: 256
// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>

// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

// namespace
using namespace std;

// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<VB> VVB;

// conversion
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)

// container
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); i++)
#define SORT(c) sort((c).begin(), (c).end())
#define GSORT(c) sort((c).begin(), (c).end(), greater<decltype((c).front())>())
#define SZ(x) (INT((x).size()))
#define MEMSET(c, v) memset((c), v, sizeof(c))

// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)

// constant
const ll MOD = 1e9 + 7;
// const int INF = 1<<25;
// const ll INF = 1LL<<50;
// const int dx[4] = {0, -1, 1, 0};
// const int dy[4] = {-1, 0, 0, 1};
// const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const int dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};

// debug
#define test(x) cout << #x << " = " << x << endl

// answer output
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;

#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;


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


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll N, ans = 1;
  cin >> N;
  for (ll i = 1; i <= N; i++) {
    ans = ans * i % MOD;
  }
  cout << ans << endl;
  return 0;
}

Measured memory_bytes: 256
#include <iostream>
using namespace std;

int main() {
  int h,m,s,from,to;
  for(int i=0;i<3;i++) {
    cin >> h >> m >> s;
    from = 3600*h +m*60+ s;
    cin >> h >> m >> s;
    to = 3600*h +m*60+ s;
    int diff = to-from;
    h = diff / 3600;
    diff %= 3600;
    m = diff / 60;
    diff %= 60;
    s = diff;
    cout << h << " " << m << " " << s << endl;
  }
}

Measured memory_bytes: 0