akhauriyash/Code-Regression huggingface dataset:
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  int k; string s; cin >> k >> s;
  if (s.size() > k)
    cout << s.substr(0, k) << "..." << endl;
  else cout << s << endl;
  return 0;
}

Measured memory_bytes: 3604
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		// スペース区切りの整数の入力
		int syaink = sc.nextInt();
        int syainj = sc.nextInt();
      System.out.println(syaink*syainj);
}
}

Measured memory_bytes: 35720
import java.util.*;
public class Main {
    public static void main(String [] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long L [] =  new long[n];
        for(int i=0;i<n;i++) L[i] = sc.nextLong();
        int q = sc.nextInt();
        for(int i=0;i<q;i++){
            int b = sc.nextInt();
            int e = sc.nextInt();
            int num = 1;
            for(int j=b;j<(b+e)/2;j++){
                long now = L[j];
                L[j] = L[e-num];
                L[e-num] = now;
                num++;
            }
        }
        System.out.print(L[0]);
        for(int i=1;i<n;i++) System.out.print(" "+L[i]);
        System.out.println();
    }
}


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

int main() {
  int N;
  cin >> N;
  
  if(N == 1) {
    cout << "Hello World" << endl;
  }
  else if(N==2) {
    int A,B;
    cin >> A >> B;
    cout << A+B << endl;
  }
}


Measured memory_bytes: 384
s=chomp(readline())*"z"
id=1
if s[id]=='A'
	id+=1
end
if s[id]=='K'
	id+=1
else
	println("NO")
	exit()
end
if s[id]=='I'
	id+=1
else
	println("NO")
	exit()
end
if s[id]=='H'
	id+=1
else
	println("NO")
	exit()
end
if s[id]=='A'
	id+=1
end
if s[id]=='B'
	id+=1
else
	println("NO")
	exit()
end
if s[id]=='A'
	id+=1
end
if s[id]=='R'
	id+=1
else
	println("NO")
	exit()
end
if s[id]=='A'
	id+=1
end
if s[id]=='z'
	println("YES")
else
	println("NO")
end


Measured memory_bytes: 109832
//*******************************By Harry Singh From Phillaur.
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000006
const ll mo=1000000007;
#define string_to_any_base(s,base) stoll(s, 0, base);
#define vc vector
// #define mp map<ll,ll> mp;
#define bt(M,value) bitset<M> b(value)
#define S set<ll> s;
#define pb push_back
#define ST set<string> s;
#define INF 1e15
using namespace std;
set<ll> primes;
vector<pair<ll,ll>> adj[MAX];
vector<ll> ad[MAX];
///******************************ALL important functions;
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b);} 
ll lcm(ll a, ll b)  {  return (a*b)/gcd(a, b);  } 
void Sieve(){ bool prime[MAX+1]; memset(prime, true, sizeof(prime)); for (int p=2; p*p<=MAX; p++) { if (prime[p] == true) {for (int i=p*p; i<=MAX; i += p) prime[i] = false; } } for(int i=2;i<=MAX;i++)if(prime[i]==true)primes.insert(i);} 
ll comb(ll N_, ll C_) {
	const int NUM_=400001;
	static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
	if (fact[0]==0) {
		inv[1]=fact[0]=factr[0]=1;
		for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
		for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	}
	if(C_<0 || C_>N_) return 0;return factr[C_]*fact[N_]%mo*factr[N_-C_]%mo;}
ll modpow(ll a, ll n=mo-2) {ll r=1;while(n)r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;return r;}





int main()
{

ll n,k;cin>>n>>k;
vc<ll> v;ll a[n+1];
for(int i=1;i<=n;i++)
cin>>a[i];

for(int i=1;i<=n;i++)
{
	v.pb(a[i]);
	ll sum=a[i];
		for(int j=i+1;j<=n;j++)
		sum+=a[j],v.pb(sum);
	
}
ll ans=0;
vc<ll> temp;
for(int i=50;i>=0;i--)
{
	ll val=1ll<<i,count=0;
	for(auto sd:v)
	if(val&sd)count++;
	
	if(count<k)continue;
	
	ans^=val;/// means take tis bit and mvoe forward baby
	for(auto sd:v)
	if(val&sd)temp.pb(sd);
	
	v=temp;
	temp.clear();
	
}
cout<<ans<<endl;





}



Measured memory_bytes: 53488
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;

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

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

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

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

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};


///////////////////////////


int main() {
	
	ll N, X, Y;
	cin >> N >> X >> Y;
	vector<ll> ans(N, 0);

	repn(i, N) {
		for (ll j = i + 1; j <= N; j++) {
			ll dis = abs(i - j);
			dis = min(dis, abs(i - X) + 1 + abs(Y - j));
			dis = min(dis, abs(j - X) + 1 + abs(Y - i));
			ans[dis]++;
		}
	}

	repn(i, N - 1) {
		cout << ans[i] << endl;
	}

	system("PAUSE");
}


Measured memory_bytes: 504
#include <iostream>
#include <cmath>
using namespace std;
int l[10];
int main(){
	int i,j,n,a,b,c,ans = 1000000;
	cin >> n >> a >> b >> c;
	for(i=0;i<n;i++){
		cin >> l[i];
	}
	for(i=0;i<1<<(2*n);i++){
		int res[10],k;
		k = i;
		for(j=0;j<n;j++){
			res[j] = k%4;
			k /= 4;
		}
		int sum[4] = {},num[4] = {},ret = 0;
		for(j=0;j<n;j++){
			sum[res[j]] += l[j];
			num[res[j]]++;
		}
		for(j=0;j<3;j++){
			if(num[j]==0) ret = 10000000;
			else ret += 10*(num[j] - 1);
		}
		ret += abs(a - sum[0]) + abs(b - sum[1]) + abs(c - sum[2]);
		ans = min(ans,ret);
	}
	cout << ans << endl;
}

Measured memory_bytes: 256
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"
const int N = 1e6;
int dv[1 + N];
int main () {
    ios::sync_with_stdio (false);
    cin.tie (0); cout.tie (0);

    int n;
    cin >> n;
    for (int d = 1; d <= n; d++)
        for (int i = d; i <= n; i += d)
            dv[i]++;
    ll ans = 0;
    for (int i = 1; i < n; i++)
        ans += dv[i];
    cout << ans << "\n";
    return 0;
}


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

int main() {
  int a, b;
  cin>>a>>b;
  if (b == 1) {
    cout<<0<<endl;
    return 0;
  }
  for (int i=1; i<=100; i++) {
    if (a * i - i + 1 >= b) {
      cout<<i<<endl;
      break;
    }
  }
}

Measured memory_bytes: 256
#include <iostream>
#include <queue>
#include <vector>
#include <cstring>
#include <vector>
#include <cstdlib>
using namespace std;
int N;
vector<int> G[200005];
vector<int> Gt[200005];
bool viz[200005];
int dist[200005];
int gr[200005];
int nxt[200005];
bool U[200005];
int  V[200005];
vector<int> ord;
queue<int> Q;
int mex(int nod)
{
    int mex=0;
    while(U[mex])mex++;
    for(auto it:G[nod])U[V[it]]=0;
    return mex;
}
int main()
{
    cin>>N;
    for(int i=1;i<=N;i++)
    {
        int x=i,y;
        cin>>y;
        G[y].push_back(x);
        Gt[x].push_back(y);
        gr[y]++;
    }
    for(int i=1;i<=N;i++)
    {
        if(!gr[i])Q.push(i);
    }
    while(!Q.empty())
    {
        int nod=Q.front();Q.pop();
        for(auto it:Gt[nod])
        {
            gr[it]--;
            if(!gr[it])
                Q.push(it);
        }
        ord.push_back(nod);
    }
    for(auto it:ord)
    {
        for(auto it2:G[it])
            if(!gr[it2])
                U[V[it2]]=1;
        V[it]=mex(it);
    }
    int len=0;
    for(int i=1;i<=N;i++)
    {
        if(gr[i])
        {
            len++;
            for(auto it2:G[i])
                if(!gr[it2])
                    U[V[it2]]=1;
            V[i]=mex(i);
        }
    }
    int nr=0;
    for(int i=1;i<=N;i++)
    {
        if(gr[i])
        {
            if(!U[V[i]])nr++;
            U[V[i]]=1;
        }
    }
    if(nr>=2||len%2==0)cout<<"POSSIBLE";
    else cout<<"IMPOSSIBLE";
    return 0;
}


Measured memory_bytes: 23936
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

int ans[100100];
string s;

int main(void){
	int n,i,p,c;
	cin >> s;
	n = s.l_ength();
	for(i=1; i<n; ++i){
		if(s[i-1]=='R' && s[i]=='L'){
			p = i;
			c = 0;
		}
		if(s[i]=='L'){
			++ans[p-c];
			c = (1-c);
		}
	}
	for(i=(n-1); i>0; --i){
		if(s[i-1]=='R' && s[i]=='L'){
			p = i-1;
			c = 0;
		}
		if(s[i-1]=='R'){
			++ans[p+c];
			c = (1-c);
		}
	}
	for(i=0; i<n; ++i){
		cout << ((i)?" ":"") << ans[i];
	}
	cout << endl;
	return 0;
}


Measured memory_bytes: 1024
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int maxm = 1 << 15 + 10;
const int inf = 0x3f3f3f3f;

int n, ans, state;
int v[maxn], cnt[20], f[maxm];

int dp(int s) {
	if (!s) return 0;
	if (f[s] < inf) return f[s];
	for (int i = 0; i <= 15; ++i) {
		if (!(s & (1 << i))) continue;
		for (int j = 0; j <= 15; ++j) {
			if (i == j || !(s & (1 << j))) continue;
			int x = i ^ j;
			int y = s ^ (1 << i) ^ (1 << j) ^ (1 << x);
			if (s & (1 << x)) f[s] = min(f[s], dp(y) + 2);
			else f[s] = min(f[s], dp(y) + 1);
		}
	}
	return f[s];
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i < n; ++i) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		x += 1, y += 1;
		v[x] ^= z; v[y] ^= z;
	}
	for (int i = 1; i <= n; ++i) cnt[v[i]]++;
	for (int i = 1; i <= 15; ++i) {
		ans += (cnt[i] >> 1);
		state += (cnt[i] & 1) * (1 << i);
	}
	memset(f, 0x3f, sizeof(f));
	printf("%d\n", ans + dp(state));
	return 0;
}

Measured memory_bytes: 131712
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

public class AtCoderA
{
    static void Main()
    {
        var sc = new Scanner();

        long a = sc.NextInt();
        long v = sc.NextInt();
        long b = sc.NextInt();
        long w = sc.NextInt();
        long t = sc.NextInt();

        long dx = Math.Abs(a - b);
        long dv = v - w;

        bool ok = true;

        if (dv <= 0)
        {
            ok = false;
        }

        if (dv * t < dx)
        {
            ok = false;
        }

        string answer = ok ? "YES" : "NO";

        Console.WriteLine(answer);
    }

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


Measured memory_bytes: 27492
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EAlmostEverywhereZero solver = new EAlmostEverywhereZero();
        solver.solve(1, in, out);
        out.close();
    }

    static class EAlmostEverywhereZero {
        int k;
        char[] arr;
        long[][][] memo;

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            arr = sc.next().toCharArray();
            k = sc.nextInt();
            memo = new long[2][k + 1][arr.length];
            for (long[][] x : memo)
                for (long[] y : x)
                    Arrays.fill(y, -1);
            pw.println(dp(0, k, 0));
        }

        private long dp(int idx, int rem, int s) {
            if (rem < 0)
                return 0;
            if (idx == arr.length)
                return rem == 0 ? 1 : 0;
            if (memo[s][rem][idx] != -1)
                return memo[s][rem][idx];
            boolean small = s == 1;
            int end = small ? 9 : arr[idx] - '0';
            long sum = 0;
            for (int i = 0; i <= end; i++) {
                sum += dp(idx + 1, i != 0 ? rem - 1 : rem, i < arr[idx] - '0' ? 1 : s);
            }
            return memo[s][rem][idx] = sum;
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}



Measured memory_bytes: 22612
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef map <int , int> mint;
typedef map <ll , ll> mll;
typedef set <int> si;
typedef set <ll> sll;
typedef si :: iterator sitr;
typedef si :: reverse_iterator rsitr;
typedef sll :: iterator sltr;
typedef sll :: reverse_iterator rsltr;
#define mset multiset
 
typedef mset <int> msi;
typedef mset <ll> msll;
typedef msi :: iterator msitr;
typedef msi :: reverse_iterator msritr;
typedef msll :: iterator msltr;
typedef msll :: reverse_iterator mslritr;
 
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
 
char to_upper (char x){
    if( 97 <= int(x) && int(x) <= 122)return char(x-32);
    else if( 65 <= int(x) && int(x) <= 90)return x;
}
char to_lower (char x){
    if( 97 <= int(x) && int(x) <= 122)return x;
    else if( 65 <= int(x) && int(x) <= 90)return char(x+32);
}
int numerize (char x){
    if(48 <= int(x) && int(x) <= 57)return int(x-'0');
    else if( 97 <= int(x) && int(x) <= 122)return int(x-96);
    else if( 65 <= int(x) && int(x) <= 90)return int(x-64);
}
bool isect (int l1, int r1, int l2, int r2){
    pii p1,p2;
    p1 = mp(l1,r1); p2 = mp(l2,r2);
    if(p1>p2)swap(p1,p2);
    if(p2.fi <= p1.se)return true;
    else return false;
}
ll quickpow (ll num1, ll num2, ll MOD){
    if(num2==0)return 1;
    else if(num2==1)return num1;
    else{
        ll temp = quickpow (num1,num2/2,MOD); ll res = ((temp%MOD) * (temp%MOD))%MOD;
        if(num2%2==1) res = ((res%MOD)*(num1%MOD))%MOD; return res;
    }
}
ll invmod (ll num, ll MOD){return quickpow (num,MOD-2,MOD);}
ll gcd (ll num1, ll num2){
    if(num1 < num2) swap(num1,num2); ll num3 = num1 % num2 ;
    while(num3 > 0){ num1 = num2; num2 = num3; num3 = num1 % num2;}
    return num2;
}
ll lcm (ll num1 , ll num2){return (ll) (num1/__gcd(num1,num2))*num2;}
// end of Template
str res,a,b,c;
int main(){
 
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
 
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  
  	cin>>a>>b>>c;
	res += to_upper(a[0]);
	res += to_upper(b[0]); 
	res += to_upper(c[0]);
  	cout<<res<<newl;
}

Measured memory_bytes: 384
import java.util.Scanner;

public class Main {

    public static void main(String args[]) {

        Scanner sc = new Scanner(System.in);
        int a = Integer.parseInt(sc.next());
        int b = Integer.parseInt(sc.next());

        int result = -1;
        if (a >= 1 && a <= 9 && b >= 1 && b <= 9) {
            result = a * b;
        }

        System.out.println(result);
    }
}

Measured memory_bytes: 23124
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
const long long Mo=1000000007;
     
long long gcn(long long x,long long y){
  if(x%y==0){
    return y;  
  }
  else{
    return gcn(y,x%y);
  }
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main(void){
  double tmp;
  long long n;
  long long x;
  long long i,j;
  long long res=0;

  cin>>n;
  
  while(n>0){
    //cout<<"n "<<n<<endl;
    
    x=(1.0+pow(-1+8*n,0.5))/2;
    cout<<x<<endl;
    n=n-x;
  }
  

  //cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 4044
#include <stdio.h>
int main(void){
    int A, B, coin=0, max;
    
    scanf("%d %d",&A, &B);
    
    if(A>B){
        coin=A;
        if(A-1>B){
            coin=coin+(A-1);
        }else{
            coin=coin+B;
        }
    }else{
        coin=B;
        if(B-1>A){
            coin=coin+(B-1);
        }else{
            coin=coin+A;
        }
    }
    
    printf("%d",coin);
}


Measured memory_bytes: 128
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int> a(m);
	rep(i, m) cin >> a[i];
	ll sum = 0;
	rep(i, m) sum += a[i];
	if (sum <= n) cout << n - sum << endl;
	else cout << -1 << endl;
	return 0;
}


Measured memory_bytes: 3660
//高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw

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

#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007 

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
    for (T& x: vec) { is >> x; }
    return is;
}

int main() {
	ll ans = -LLONG_MAX;
	ll tmp;
	int n, k; cin >> n >> k;
	bool ch[n];
	vector<ll> p(n), c(n);
	cin >> p;
	cin >> c;
	REP(i, n){
		REP(j, n) ch[j] = false;
		ll shu = 0, step = 0;
		tmp = 0;
		int now = i;
		while(!ch[now]){
			ch[now] = true;
			now = p[now] - 1;
			shu += c[now];
			step++;
		}
		ll res;
		if(shu > 0 && k > step){
			tmp = (ll)(k / step - 1) * shu;
			res = k % step + step;
			ans = max(ans, tmp);
		}
		else if(k > step) res = step;
		else res = k;
		now = i;
		REP(j, res){
			now = p[now] - 1;
			tmp += c[now];
			ans = max(ans, tmp);
		}
	}
	cout << ans << endl;
}

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

/*char型->int型*/
int ctoi(char c){               //8bit -> 32bit 情報落ちはなし?
  return int(c - '0');
}

/*任意の隣り合うタイルが異なる色で塗られているような場合は2通りしかない。
010101...または101010...よってどちらに類似しているかを判断すればよい。
一方が求まればもう一方は文字列の長さ-一方の値で求まる。小さいほうの値が
今回求める値?*/

int main(){       
  string s;  cin >> s;
  int an01 = 0; int len = s.size();

  for(int i = 0; i < len; i++)
    if(ctoi(s[i]) == (i & 1)) an01++;
  

  cout << min(an01, len-an01) << endl;
  return 0;
  
}
  

Measured memory_bytes: 512
#include <stdio.h>
#include <math.h>
using namespace std;
constexpr int kN = int(2E5 + 10);
int a[kN];
long double s[kN], v[kN];
int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) s[i] = s[i - 1] + log10l(a[i]);
	for (int i = k; i <= n; i++) v[i] = s[i] - s[i - k];
	for (int i = k + 1; i <= n; i++) if (v[i] > v[i - 1]) printf("Yes\n");
	else printf("No\n");
}


Measured memory_bytes: 9092
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
inline int read() {
	char ch = getchar(); int x = 0;
	while(ch < '0' || ch > '9') ch = getchar();
	while(ch >= '0' && ch <= '9') x = x*10+ch-'0', ch = getchar();
	return x;
}


const int N = 5e5+5;

ll d[N], a[N], g[N];
int n, q;

int main() {
	n = read(), d[0] = read();
	for(int i = 1; i <= n; ++i) a[i] = read();
	for(int i = 1; i <= n; ++i) {
		ll nd = abs(d[i-1] - a[i]);
		if(nd < d[i-1]) d[i] = nd;
		else d[i] = d[i-1];
	}

	g[n+1] = 1;
	for(int i = n; i; --i) {
		ll nd = abs(g[i+1] - a[i]);
		if(nd >= g[i+1]) g[i] = g[i+1];
		else g[i] = g[i+1] + a[i];
	}


	q = read();
	while(q--) {
		int x = read();
		int y = g[x+1] <= d[x-1];
		printf("%s\n", y ? "YES" : "NO");
	}
	return 0;
}

Measured memory_bytes: 13568
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int V[300000], W[300000];

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


	rep1(i, 5) {
		int x;
		cin >> x;

		if (x == 0) {
			co(i);
			return 0;
		}



	}


	Would you please return 0;
}

Measured memory_bytes: 3644
#include "bits/stdc++.h"
using namespace std;

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

const int INF = 1000000007;

int main(){
	int n;
	cin>>n;
	int t[110000]={0}, x[110000]={0}, y[110000]={0};
	for(int i=1;i<=n;i++)cin>>t[i]>>x[i]>>y[i];

	bool can = true;
	for(int i=0;i<n;i++){
		int dt = t[i+1] - t[i];
		int dist = abs(x[i+1]-x[i]) + abs(y[i+1]-y[i]);
		if(dt < dist) can = false;
		if(dist%2 != dt%2) can = false;
	}

	if(can) cout<< "Yes" <<endl;
	else cout<< "No" <<endl;

	return 0;
}

Measured memory_bytes: 1536
/**
 *      purpose : 「みんなのプロコン 2019」C
 *      author  : kyomukyomupurin
 *      created : 
**/

// input/output
#include <iostream>
#include <fstream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// math, algorithm
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// etc
#include <bitset>
#include <cctype>
#include <chrono>
#include <iomanip>
#include <random>
#include <utility>
// using-directive
using namespace std;
// alias template
using int64 = int64_t;
using pii = pair<int, int>;
using pll = pair<int64_t, int64_t>;
// text macro replacement
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define print(x) cout << (x) << '\n'
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define fi first
#define se second

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int64 k, a, b; cin >> k >> a >> b;
    int64 nowbis = 1;

    // 1. +1, 2. A to 1 3. 1 to B

    if (b < a){  // only 1
        print(1 + k);
    }
    else if (b == a){
        print(1 + k);
    }
    else if (b > a){
        if (a + 1 == b) print(1 + k);
        // int64 cnt = 0;
        else {
            int64 cnt = 0;
            while (cnt < k){
                if (nowbis >= a && cnt <= (k - 2)){
                    nowbis += (b - a); cnt += 2;
                }
                else if (nowbis >= a && cnt > (k - 2)){
                    ++nowbis; ++cnt;
                }
                else {
                    ++nowbis; ++cnt;
                }
            }
            print(nowbis);
        }
    }

    
    
    return 0;
}

Measured memory_bytes: 256
#include <iostream>
#include <string>
#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

int main()
{

   int n=0,k=0,q=0; cin >> n >> k >> q;

   int a,b[n+1];

   for(int i=1;i<=n;i++) { b[i]=(k-q) ; }
  // for(int i=0;i<n;i++) { cout << b[i] << endl; }
   for(int i=0;i<q;i++)
   {
       scanf("%d",&a);

           b[a]++ ;
           //for(int i=0;i<n;i++) { cout << b[i] << endl; }
   }

   for(int i=1;i<=n;i++)
   {
       if(b[i]>0) printf("Yes\n");
       else printf("No\n");
   }

    return 0;
}


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

int main() {
  int a, b, c;
  string ans = "NO";
  cin >> a >> b >> c;
  if(a==5||a==7){
    if(b==5||b==7){
      if(b==5||b==7){
        if(a+b+c==17){
          ans = "YES";
        }
      }
    }
  }
  cout << ans << endl;
}


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

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

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

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.141592653589793238462643383279;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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

int main(void){
    ll A,B,N; cin >> A >> B >> N;
    ll ans = A*min(N,B-1) / B;

    cout << ans << en;
    return 0;
}

Measured memory_bytes: 3632
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <complex>
#include <vector>
#include <list>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
#if __cplusplus >= 201103
#include <numeric>
#endif
using namespace std;
typedef long long ll;

int main(){
   int n;
   cin >> n;
   if(1<=n && n<=999){
       cout << "ABC" << endl;
   }
   else cout <<"ABD"<<endl;
}

Measured memory_bytes: 256
//----------------------------templates
    #pragma GCC optimize ("Ofast")
    #pragma GCC target ("tune=native")
    #pragma GCC target ("avx")
    //----------------------------
    #include <bits/stdc++.h>
    using namespace std;

    typedef long long ll;
    typedef unsigned long long ull;
    #define int ll

    #define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
    #define REP(i,n) for (int i=0;i<(int)(n);i++)
    #define REPS(i,n) for (int i=1;i<=(int)(n);i++)
    #define REPN(i,n) for (int i=(int)(n)-1;i>=0;i--)
    #define REPNS(i,n) for (int i=(int)(n);i>0;i--)

    #define I(n) scanf("%d", &(n))
    #define LL(n) scanf("%lld", &(n))
    #define pb(n) push_back((n))
    #define mp(i,j) make_pair((i),(j))
    #define eb(i,j) emplace_back((i),(j))
    #define y0 y3487465
    #define y1 y8687969
    #define j0 j1347829
    #define j1 j234892
    #define uniq(v) v.erase( unique(v.begin(), v.end()), v.end() )

    #define all(x) (x).begin(),(x).end()
    #define sz(x) ((int)(x).size())

    typedef vector<int> vi;
    typedef pair<int,int> pi;
    typedef vector<pi> vpi;
    typedef vector<vi> vvi;
    typedef vector<vpi> vvpi;
    typedef vector<vvi> vvvi;

    const int mod = 1000000007;

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

string s;
vi black;
int ret;
signed main(){
    cin >> s;
    int n = s.size();
    black.resize(n);

    black[0] = (s[0] == 'B');
    REPS(i,n-1){
        black[i] = black[i-1] + (s[i] == 'B');
        if (s[i] == 'W') ret += black[i];
    }
    cout << ret << endl;
}

Measured memory_bytes: 2180
package main 

import (
    "bufio"
    "fmt"
    "os"
    )
    
    var r = bufio.NewReader(os.Stdin)
    
    func main() {
        var a int
        var b int 
        var c int
        fmt.Fscan(r, &a, &b, &c)
        
        if (a < b && b < c) {
            fmt.Println("Yes")
        } else {
            fmt.Println("No")
        }
    }
    


Measured memory_bytes: 1144
#include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep (i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
  #include "../../Lib/cout_container.hpp"
  #define debug(x) cerr << #x " => " << x << endl
#else
  #define debug(x) 0
#endif
using lint = long long;
constexpr int    INF  = 1 << 30;
constexpr lint   INFL = 1LL << 62;
constexpr int    MOD  = (int)1e9 + 7;
constexpr double EPS  = 1e-9;
using namespace std;
namespace { struct INIT { INIT() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } INIT; }

int main(void) {
  lint n, k;
  cin >> n >> k;
  vector<int> a(n), f(n);
  rep (i, n) cin >> a[i];
  rep (i, n) cin >> f[i];
  sort(all(a));
  sort(all(f), greater<int>());
  lint ok = 1e13, ng = -1;
  while (ok - ng > 1) {
    lint mid = (ok + ng) / 2, x = 0;
    rep (i, n) x += max(0LL, a[i] - mid / f[i]);
    if (x <= k) ok = mid;
    else ng = mid;
  }
  cout << ok << endl;
  return 0;
}

Measured memory_bytes: 1792
#include<iostream>

bool flg[30];

int main(){
	for(int i=0,a;i<28;i++){
		std::cin>>a;
		flg[a]=true;
	}
	for(int i=1;i<=30;i++){
		if(!flg[i])std::cout<<i<<std::endl;
	}
	return 0;
}

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

int main(){
	int r, d, x;
	cin >> r >> d >> x;

	rep(i,10){
		x = r*x-d;
		cout << x << endl;
	}

	return 0;
}


Measured memory_bytes: 256
using System;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static void Main(string[] args)
    {
        string s = Console.ReadLine();
        int f = 0;
        int l = 0;
        for(int i = 0; ; i++)
            if(s[i] == 'A')
            {
                f = i;
                break;
            }
        for(int i = s.Length - 1; ; i--)
            if(s[i] == 'Z')
            {
                l = i;
                break;
            }
        Console.WriteLine(l - f + 1);
    }
}


Measured memory_bytes: 11616
n = list(map(int, list(input())))
k = int(input())
l = len(n)
dp0 = [[0]*(k+1) for _ in range(l+1)] #小さいの確定
dp1 = [[0]*(k+1) for _ in range(l+1)]

for i in range(1, l+1):
    dp0[i][0] = 1

dp1[0][0] = 1

for i in range(l):
    for j in range(k):

        if n[i] > 0:

            dp0[i+1][j+1] = \
                9*dp0[i][j] + dp0[i][j+1] + dp1[i][j+1] + (n[i]-1)*dp1[i][j]
            dp1[i + 1][j + 1] = dp1[i][j]
        else:

            dp0[i+1][j+1] = \
                9*dp0[i][j] + dp0[i][j+1]
            dp1[i + 1][j + 1] = dp1[i][j + 1]



# print(dp1[l][k])
print(dp0[l][k] + dp1[l][k])


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

int N, K;

// (N+x) / b > N/b
int posInc(int b) {
   int lo = 1, hi = b;
   while(lo < hi) {
      int m = (lo + hi) / 2;
      if((N+m)/b > N/b) hi = m;
      else lo = m+1;
   }
   return lo;
}

int calc(int b) {
   if(K >= b) return 0;
   int p = posInc(b);
   if(K == 0) {
      if(p == b) return (N / b) * b;
      else return (N / b) * p + (N/b + 1) * (b - 1 - p + 1);
   } else {
      if(p > b-K) return (N/b) * (b - K);
      else return (N/b) * (p - 1) + (N/b + 1) * (b - K - p + 1);
   }
}

int main() {
   cin >> N >> K;
   long long cc = 0;
   for(int b = 1; b <= N; b++) {
      cc += calc(b);
   }
   cout << cc << endl;
}


Measured memory_bytes: 256
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>

using namespace std;
using ll = long long;

void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }

#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define Return(expr) { Cout(expr); return 0; }
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)

// constexpr int MOD = 1e9+7;

int main(void){
    Cin(int, n);
  	Cin(string, s);
  	if(n % 2 != 0) Return("No");
    For(i, n/2){
      if(s[i] != s[i+n/2]) Return("No");
    }
  	Cout("Yes");
}


Measured memory_bytes: 256
#閉路判定
#n=頂点数 e=隣接リスト
#flag=0...DAG判定　flag=1...トポロジカルソート
from collections import deque
def find_loop(n,e,flag):
  x=[0]*n
  d=deque()
  t=[]
  c=0
  for i in range(n):
    for j in edge[i]:x[j]+=1
  for i in range(n):
    if x[i]==0:
      d.append(i)
      t.append(i)
      c+=1
  while d:
    i=d.popleft()
    for j in edge[i]:
      x[j]-=1
      if x[j]==0:
        d.append(j)
        t.append(j)
        c+=1
  if flag==0:return c==n
  else:return t

n=int(input())
edge=[[]for _ in range(n*n)]
inp=[1]*n*n
p=lambda x,y:min(x,y)*n+max(x,y)
for i in range(n):
  a=list(map(int,input().split()))
  for j in range(1,n-1):
    edge[p(i,a[j-1]-1)].append(p(i,a[j]-1))
if find_loop(n*n,edge,0)==False:print(-1);exit()
t=find_loop(n*n,edge,1)
ans=[1]*n*n
for i in t:
  for j in edge[i]:ans[j]=max(ans[j],ans[i]+1)
print(max(ans))


Measured memory_bytes: 213348
#include<bits/stdc++.h>
const int MAX_N=2000;
const int INF=1e5;
using namespace std;
int n,m;char maper[MAX_N][MAX_N];int ans[MAX_N][MAX_N];
int dir[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,-1},{1,1},{-1,1},{-1,-1}};
void find(int x,int y){
    for(int i=0;i<8;i++){
    	int xn=x+dir[i][0];
    	int yn=y+dir[i][1];
    	ans[xn][yn]++;
    }	
    return ;
}
int main(){
    memset(ans,0,sizeof(ans));
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    	for(int j=1;j<=m;j++)
    		cin>>maper[i][j];

    for(int i=1;i<=n;i++)
    	for(int j=1;j<=m;j++)
            if(maper[i][j]=='#')
    			find(i,j);
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		if(maper[i][j]=='#')
    			cout<<"#";
    		else cout<<ans[i][j];
        }
        cout<<endl;
    }
    
}

Measured memory_bytes: 16640
def powmod(b,r,mod)
  a = 1
  while r > 0
    if r%2 == 1
      a = a * b % mod
    end
    b = b * b % mod
    r /= 2
  end
  a
end

def invmod(f, mod)
  powmod(f, mod-2, mod)
end

N = gets.to_i
M = gets.chomp.size
Mod = 10**9+7

dp = (0..1).map{ Array.new(N+1,0) }
dpn,dpnn = dp[0],dp[1]
dpn[0] = 1
(0...N).each{ |n|
  dpnn.fill(0)
  nn = [n,N+M-n].min
  ni = [n-N+M,0].max
  mm = nn+1
  mi = nn-1
  mi = 0 if mi < 0
  #p [n,N+1+M-n,nn]
  dpn[ni..nn].reverse_each{ |v|
    dpnn[mm] = (dpnn[mm] + 2 * v) % Mod
    dpnn[mi] = (dpnn[mi] +     v) % Mod
    mm -= 1
	next if mi <= 0
    mi -= 1
  }
  dpn,dpnn = dpnn,dpn
}
p dpn[M] * powmod(invmod(2, Mod), M, Mod) % Mod


Measured memory_bytes: 22656
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

int main(){
    ll N, Q;
    string S;
    cin >> N >> S >> Q;

    vector<set<ll> > rec(26, set<ll>({50000000}));
    rep(i, 0, N) rec[S[i] - 'a'].insert(i+1);
    
    rep(q, 0, Q){
        ll type; cin >> type;
        if(type == 1){
            ll i; char c;
            cin >> i >> c;
            rec[S[i-1] - 'a'].erase(i);
            S[i-1] = c;
            rec[c - 'a'].insert(i); 
        }else{
            ll l, r; cin >> l >> r;
            ll ans = 0;
            rep(c, 0, 26){
                ll L = *rec[c].lower_bound(l);
                ll R = *rec[c].lower_bound(r+1);
                if(R > L) ans++;
            }
            cout << ans << endl;
        }
    }
}

Measured memory_bytes: 26244
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <complex>

using namespace std;
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using i32 = int_fast32_t;
using u32 = uint_fast32_t;

#define int i64

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

	string res(s.size(), 'x');

	cout << res << endl;
	
	return 0;
}


Measured memory_bytes: 256
#include <bits/stdc++.h>
#define MAX_N 100007
#define MOD 1000000007
using namespace std;
typedef long long ll;

int N;
ll a[MAX_N], b[MAX_N];
ll inv[MAX_N], sum[MAX_N], res;

inline void init () {
    inv[0] = inv[1] = 1;
    for (int i = 2;i <= N; ++i)
        inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
    for (int i = 1;i <= N; ++i)
        sum[i] = sum[i - 1] + inv[i];
}

int main () {
    scanf("%d", &N);
    for (int i = 1;i <= N; ++i)
        scanf("%d", a + i);
    init();
    for (int i = 1;i <= N; ++i)
        b[i] = (sum[N - i + 1] - 1 + sum[i] + MOD) % MOD;
    for (int i = 1;i <= N; ++i)
        (res += a[i] * b[i]) %= MOD;
    for (int i = 2;i <= N; ++i)
        res = res * i % MOD;
    printf("%lld\n", res % MOD);
    return 0;
}


Measured memory_bytes: 3328
using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
	const int mod=(int)1e9+7;
	static void Main(){
		Sc sc=new Sc();
		var n=sc.I;
		for(int i = 1;i<10;i++) {
			if(n%i==0&&n/i<10){
				Console.WriteLine("Yes");
				return;
			}
		}
		Console.WriteLine("No");
	}
}

public class Sc{
	public int I{get{return int.Parse(Console.ReadLine());}}
	public long L{get{return long.Parse(Console.ReadLine());}}
	public double D{get{return double.Parse(Console.ReadLine());}}
	public string S{get{return Console.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split();}}
	public object[] Oa{get{return Console.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
	public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
	public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}

Measured memory_bytes: 13140
#include <bits/stdc++.h>
#define N 200002
#define x second.first
#define y second.second
#define z first
using namespace std;
vector<pair<float,pair<int,int>>> a;
vector<int> b,s;
int d[32][N];
int bs(int t)
{
    int r=0,p,n=s.size();
    for(p=1<<17;p;p/=2)
        if(r+p<n&&s[r+p]<=t)
            r+=p;
    return r;
}
int main()
{
    int n,t,i,j,k;
    cin>>n>>t;
    for(k=0;k<n;k++)
    {
        cin>>i>>j;
        if(i)
            a.push_back({float(i)/(j+1),{i,j}});
        else
            b.push_back(j);
    }
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    a.push_back({0,{0,0}});
    reverse(a.begin(),a.end());
    n=a.size();
    for(i=1;i<min(n,30);i++)
        for(d[i][(j=i)-1]=t+1;j<n;j++)
            d[i][j]=min(1LL*d[i][j-1],1LL*(d[i-1][j-1]+1)*(a[j].x+1)+a[j].y);
    s.push_back(0);
    for(auto it:b)
    {
        s.push_back(s.back()+it+1);
        if(s.back()>t)
            break;
    }
    for(k=0,i=0;i<n&&d[i][n-1]<=t;i++)
        k=max(k,i+bs(t-d[i][n-1]));
    cout<<k;
    return 0;
}

Measured memory_bytes: 26992
#include<bits/stdc++.h>
// iteration and input/output stream
#define rep(i,a,b) for(int i = int(a);i<=int(b);i++)
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define printarr(x) rep(i,0,x.size()-1) cout<<x[i]<<" "; cout<<endl;
#define all(v) v.begin(),v.end()
 
#define si(x) int x; scanf("%d", &x)
#define sll(x) ll x; scanf("%lld", &x)
#define pi(x) printf("%d", x)
#define pll(x) printf("%lld", x)
#define nl printf("\n")
#define tr(cont,it) \
for(decltype(cont.begin()) it = cont.begin(); it!= cont.end() ; it++)
 
#define endl "\n"
#define tc() int t; cin >> t ; while (t--)
//STL shortcuts
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define F first
#define S second
#define MP make_pair
 
// // Error detection
// #define trace1(x)                cerr<<#x<<": "<<x<<endl
// #define trace2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
// #define trace3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
// #define trace4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
// #define trace5(a, b, c, d, e)    cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
// #define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
 
using namespace std;
 
typedef long long int ll; // 64 bit integer
typedef unsigned long long int  ull; // 64 bit unsigned integer
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<int,ll> pill;
 
inline void smax(int &x , int y) { x = max(x , y) ; }
inline void smin(int &x , int y) { x = min(x , y) ; }
 
#define MOD 1000000007
#define inf 4000000000000000000LL
#define SYNC std::ios::sync_with_stdio(false);  cin.tie(NULL);


#define trace2(x,y) cout<<#x<<" : "<<x<<" "<<#y<<": "<<y<<" \n";

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    freopen("err.txt","w",stderr);
    #endif
    SYNC
    int n,m,k;
    cin>>n>>m>>k;
    vll a(n+1),b(m+1);        
    for (int i = 1; i <= n; i++)
    {
        cin>>a[i];
    }
    for (int j = 1; j <= m; j++)
    {
        cin>>b[j];
    }

    vll A(n+1), B(m+1);//A[0] = 0, B[0]= 0
    A[0]= 0; B[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        A[i] = A[i-1]+  a[i];
    }
    for (int i = 1; i <= m; i++)
    {
        B[i] = B[i-1] + b[i];
    }

    int i =0 , j = m;
    int maxi  =0;
    while(i<=n)
    {
        while(j>=0 && A[i]+B[j]>k)
        {
            j--;
        }
        if(j>=0 && (A[i]+B[j])<=k)
        {
            // cout<<B[j]<<"\n";
            // cout<<"hi"<<"\n";
            // cout<<A[i]<<" "<<B[j]<<"\n";
            // trace2(A[i],B[j]);
            maxi = max(maxi,i+j);
        } 
        i++;
    }
    cout<<maxi<<"\n";
    return 0;
}

Measured memory_bytes: 9544