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

using namespace std;

typedef long long ll;
typedef long double Double;
#define rep(i, n) for(int i = 0; i < (int)(n) ; i++)

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

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

template<class T>
class Compress {
private:
    vector <T> data;

public:
    Compress(const vector <T> &vec) : data(vec) {
        sort(data.begin(), data.end());
        data.erase(unique(data.begin(), data.end()), data.end());
    }

    T get(int k) {
        assert(k >= 0 && k < data.size());
        return data[k];
    }

    typename vector<T>::iterator lower_bound(const T &t) {
        return ::lower_bound(data.begin(), data.end(), t);
    }

    typename vector<T>::iterator upper_bound(const T &t) {
        return ::upper_bound(data.begin(), data.end(), t);
    }

    int lb_index(const T &t) {
        return lower_bound(t) - data.begin();
    }

    int ub_index(const T &t) {
        return upper_bound(t) - data.begin();
    }

    size_t size() {
        return data.size();
    }
};


int res[1010][1010];
int main() {
    int H, W, K;
    cin >> H >> W >> K;

    map<int, vector<int>> ps;
    vector<int> ys;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            char c;
            cin >> c;
            if (c == '#') ps[i].push_back(j), ys.push_back(i);
        }
    }

    ys.push_back(-1);
    ys.push_back(H  );

    Compress<int> c(ys);
    int lsty = 0;
    int KK = 1;
    for (auto p : ps) {
        int lst = 0;
        vector<int> xs = p.second;
        xs.push_back(-1);
        xs.push_back(W);

        Compress<int> xc(xs);
        for (auto a : p.second) {
            int ly = *--c.lower_bound(p.first);
            int uy = *c.upper_bound(p.first);
            int lx = *--xc.lower_bound(a);
            int ux = *xc.upper_bound(a);

            for(int i = ly+1 ; i < uy ; i++){
                for(int j = lx+1 ; j < ux ; j++){
                    res[i][j] = KK;
                }
            }
            KK++;
        }
    }

    for(int i = 0 ; i < H ; i++){
        for(int j = 0 ; j < W ; j++){
            cout << res[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}



Measured memory_bytes: 3320
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;

int main() {
    string s;
    cin >> s;
    int n = s.size();
    vector<int> ans(n);
    rep(ri, 2) {
        int cnt = 0;
        rep(i, n) {
            if(s[i] == 'R') {
                cnt++;
            }
            else {
                ans[i] += cnt/2;
                ans[i-1] += (cnt+1)/2;
                cnt = 0;
            }
        }

        reverse(ans.begin(), ans.end());   
        reverse(s.begin(), s.end());
        rep(i, n) {
            if(s[i] == 'L') {
                s[i] = 'R';
            }
            else {
                s[i] = 'L';
            }
        }
    }

    rep(i, n-1) {
        cout << ans[i] << " ";
    }
    cout << ans[n-1] << endl;
    
    return 0;
}

Measured memory_bytes: 1024
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
//#include <bits/stdc++.h>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
using namespace std;
#define ALL(X) X.begin(),X.end()
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD=1000000007;
//const int MOD=998244353;
const int INTMAX=2147483647;
const ll LLMAX=9223372036854775807;


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    string S;
    cin>>S;
    bool n=false,e=false,s=false,w=false;
    for(ll i=0;i<S.size();i++){
        if(S[i]=='S')s=true;
        if(S[i]=='W')w=true;
        if(S[i]=='E')e=true;
        if(S[i]=='N')n=true;
    }
    if(n+s==1 || w+e==1)cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    
    return 0;
}


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

int main(int args, char *argv[])
{
  string a, b, c;
  cin >> a;
  cin >> b;

  int x = atoi((a + b).c_str());

  for (int i = 0; i < 318; i++)
  {
    if (x == i * i)
    {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}


Measured memory_bytes: 256
import java.util.Scanner;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 整数の入力
		int a = sc.nextInt();
		int b = sc.nextInt();

		if ((a+b) % 3 == 0){
			System.out.println("Possible");
		}else if(a % 3 == 0){
			System.out.println("Possible");
		}else if(b % 3 == 0){
			System.out.println("Possible");
		}else{
			System.out.println("Impossible");
		}

		sc.close();
	}
}

Measured memory_bytes: 21972
/*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
	  	  	- William Butler Yeats
*/
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
#include<bits/stdc++.h>
#pragma comment("-Wl,--stack=1024000000")
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
const int inf=0x3f3f3f3f;
const double eps=1e-6;
const int mod=1000000007;
typedef long long ll;
#ifndef LOCAL
#define cerr if(0)cout
#define eprintf(...) 0
#else
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#endif
inline string getstr(string &s,int l,int r){string ret="";for(int i=l;i<=r;i++)ret.push_back(s[i]);return ret;}
int modpow(int x,int y,int md=mod){int ret=1;do{if(y&1)ret=(ll)ret*x%md;x=(ll)x*x%md;}while(y>>=1);return ret;}
inline int Rand(){return rand()*32768+rand();}
int n;
int a[5][100005];
bool good(int x){
	set<int>s; 
	for(int i=1;i<=3;i++){
		s.insert((a[i][x]-1)/3);
	}
	return s.size()==1;
}
bool get(int x){
	int cnt1=0,cnt2=0;
	for(int i=1;i<=3;i++){
		if(a[i][x]>a[2][x])cnt1++;
		if(a[i][x]<a[2][x])cnt2++;
	}
	if(cnt1!=1||cnt2!=1)return -1;
	return a[1][x]<a[2][x]?0:1;
}
int to[100005];
ll solve(vector<int>&arr,int l,int r){
	if(l==r)return 0;
	ll ret=0;
	int mid=(l+r)/2;
	ret+=solve(arr,l,mid);
	ret+=solve(arr,mid+1,r);
	int L=l,R=mid+1;
	vector<int>vec;
	while(L<=mid&&R<=r){
		if(arr[L]<arr[R]){
			vec.push_back(arr[L++]);
		}else{
			ret+=(mid-L+1);
			vec.push_back(arr[R++]);
		}
	}
	while(L<=mid)vec.push_back(arr[L++]);
	while(R<=r)vec.push_back(arr[R++]);
	for(int i=l;i<=r;i++)arr[i]=vec[i-l];
	return ret;
}
ll get_inv(vector<int>cur,vector<int>tar){
	for(int i=0;i<tar.size();i++)to[tar[i]]=i;
	for(auto &vv:cur)vv=to[vv];
	return solve(cur,0,cur.size()-1);
}
int ind[100005],inv[100005];
int main(){
	cin>>n;
	for(int i=1;i<=3;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		if(!good(i)){
			puts("No");
			return 0;
		}
	}
	int Odd=0,Even=0;
	for(int i=1;i<=n;i++){
		ind[i]=(a[1][i]+2)/3;
		inv[i]=get(i);
		if(inv[i]){
			if(i&1)Odd++;
			else Even++;
		}
		if(inv[i]==-1){
			puts("No");
			return 0;
		}
	}
	vector<int>checker;
	for(int i=1;i<=n;i++){
		if(i&1)checker.push_back(ind[i]);
	}
	sort(checker.begin(),checker.end());
	for(int i=0;i<checker.size();i++){
		if(checker[i]!=i*2+1){
			puts("No");return 0;
		}
	}
	vector<int>cur[2],tar[2];
	for(int i=1;i<=n;i++){
		cur[i&1].push_back(i);
		tar[i&1].push_back(ind[i]);
	}
	ll odd=get_inv(cur[1],tar[1]);
	ll even=get_inv(cur[0],tar[0]);
	cerr<<"inverse: "<<odd<<" "<<even<<endl;
	cerr<<"reverse: "<<Odd<<" "<<Even<<endl;
	if(odd%2==Even%2&&Odd%2==even%2){
		puts("Yes");
	}else{
		puts("No");
	}
	return 0;
}

Measured memory_bytes: 4500
#include<stdio.h>
#include<string.h>

// helpful functions
#define fl(i,n) for(long long i = 0; i < n; i++)
#define fls(i,a,b) for(long long i = a; i <= b; i ++)
#define afl(i,a,n) int a[n]; for(int i = 0; i < n; i++) scanf("%d", &ar[i])

// printers
#define iprint(x) printf("%d\n", x)
#define lprint(x) printf("%lld\n", x)
#define fprint(x,n) printf("%.nf\n", x)
#define dprint(x,n) printf("%.nlf\n", x)
#define sprint(x) printf("%s\n", x)

// scanners
#define iscan(x) scanf("%d", &x)
#define lcan(x) scanf("%lld", &x)
#define fscan(x) scanf("%f", &x)
#define dscan(x) scanf("%lf", &x)
#define scan(x) scanf("%s", x)
#define qs(x) long long x; scanf("%lld", &x)

int main()
{
	qs(h1); qs(m1); qs(h2); qs(m2); qs(k);
	iprint((h2-h1)*60 + (m2-m1) - k);
	return 0;
}

Measured memory_bytes: 1720
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <random>
#include <time.h>
#include <chrono>
#include <sstream>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define reverse(s) reverse(s.begin(), s.end());
#define P pair<int,int>
#define mp make_pair
#define valid(x,y,h,w) (0<=x&&x<h&&0<=y&&y<w)
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }




int main() {
	int n;
	cin >> n;
	vector<string> s(n);
	vector<int> p(n);
	rep(i, n) {
		cin >> s[i] >> p[i];
	}
	vector<int> ans(n);
	rep(i, n) {
		int c = 0;
		rep(j, n) {
			if (s[i] > s[j] ) {
				c++;
			}
			else if(s[i] == s[j] && p[i] < p[j]){
				c++;
			}
		}
		ans[c] = i;
	}
	rep(i, n) {
		cout << ans[i] + 1 << endl;
	}
}



Measured memory_bytes: 256
#include <iostream>
#include <string>
using namespace std;
    int main(){
    string S;
    cin >> S;
    if(S[0]=='a' || S[1]=='a' || S[2]=='a'){
        if(S[0]=='b' || S[1]=='b' || S[2]=='b'){
            if(S[0]=='c' || S[1]=='c' || S[2]=='c'){
                cout << "Yes" << endl;
            }else{
                cout << "No" << endl;
            }
        }else{
            cout << "No" << endl;
        }
    }else{
        cout << "No" << endl;
    }
    }

Measured memory_bytes: 256
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;

int main() {
  int N,i,ans=0;
  ll D;
  cin>>N>>D;
  vector<ll> X(N),Y(N);
  for (i=0;i<N;i++) {
    cin>>X[i]>>Y[i];
    if (X[i]*X[i] + Y[i]*Y[i] <= D*D) ans++;
  }
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 5992
# -*- coding: utf-8 -*-

import sys
from math import pi

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

R = INT()

ans = R * 2 * pi
print(ans)


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

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    vector<int> v;
    for (int i = 0; i < n; ++i) {
        int j = i;
        while (j + 1 < n && s[j + 1] == s[i]) {
            ++j;
        }
        v.push_back(j-i+1);
        i = j;
    }
    if (s[0] == '0') {
        v.insert(v.begin(), 0);
    }
    if (s[n-1] == '0') {
        v.push_back(0);
    }
    if (v.size() <= 2*k+1) {
        cout << n << endl;
        return 0;
    }
    int cur_sum = 0;
    for (int i = 0; i < 2*k+1; ++i) {
        cur_sum += v[i];
    }
    int best = cur_sum;
    for (int i = 2*k+1; i+1 < (int) v.size(); i += 2) {
        cur_sum += v[i] + v[i+1] - v[i-(2*k+1)] - v[(i+1)-(2*k+1)];
        best = max(best, cur_sum);
    }
    cout << best << endl;
    return 0;
}


Measured memory_bytes: 1020
#!/usr/bin/env python3
#!/usr/bin/env pypy3

from math import *

def main():
    import sys
    sys.dont_write_bytecode = True
    sys.setrecursionlimit(10000000)

    input = sys.stdin.readline

    #import numpy as np
    #import scipy as sp

    # Python 3 modules: https://docs.python.org/3/library/

    import os
    import math, itertools, operator
    from math import factorial as fact
    from operator import itemgetter, attrgetter
    from itertools import permutations, combinations
    from functools import reduce, lru_cache
    # Use scipy for stats: https://docs.scipy.org/doc/scipy/reference/stats.html
    # Before Python 3.5.  Import from math after it.
    from fractions import gcd
    from fractions import Fraction as Frac

    inf = float('inf')

    def lcm(a, b):
        return a * b // gcd(a,b)

    def perm(a, b):
        import scipy.special
        return scipy.special.perm(a, b, exact = True)

    def comb(a, b):
        import scipy.special
        return scipy.special.comb(a, b, exact = True)

    def dfact(n):
        import scipy.special
        return scipy.special.factorial2(n, exact = True)

    def prod(l):
        return reduce(operator.mul, l)

    def input_ints(func = input, sep = None, conv = int):
        return list(map(conv, func().split(sep = sep)))

    if os.environ.get('GOROOT') is None:
        def dprint(*args, **kwargs):
            kwargs['file'] = sys.stderr
            import inspect
            frame = inspect.currentframe().f_back
            print('[' + os.path.basename(frame.f_code.co_filename)
                    + ':' + str(frame.f_lineno) + ']', *args, **kwargs)
    else:
        def dprint(*args, **kwargs):
            pass


    ############################################################################


    n, = list(map(int, input().split()))
    P = input_ints()
    cnt = 0
    for i in range(1, n - 1):
        l = [P[i-1], P[i], P[i+1]]
        l.sort()
        if P[i] == l[1]:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()


Measured memory_bytes: 5120
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    a[i] -= i+1
a.sort()
if n%2 == 1:
    b = a[(n-1)//2]
else:
    b = a[n//2]

ans = 0
for i in a:
    ans += abs(i-b)
print(ans)

Measured memory_bytes: 86612
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

def main():
    n = int(input().strip())
    for i in range(50000):
        if int(i * 1.08) == n:
            print(i)
            return 0
    print(":(")
    

if __name__ == '__main__':
    main()


Measured memory_bytes: 39280
a,b=map(int,input().split())
s=[input()for i in range(a)]
for i in range(a):
    for j in range(b):
        c=0
        if s[i][j]==".":
            p=s[i]
            s[i]=p[:j]+str(sum([t[max(0,j-1):min(b,j+2)].count("#")for t in s[max(0,i-1):min(a,i+2)]]))+p[j+1:]
for i in range(a):
    print(s[i])

Measured memory_bytes: 3064
n,*a=map(int,open(0).read().split())
a=[0]+a+[0]
c=sum(abs(j-i)for i,j in zip(a,a[1:]))
for i,j,k in zip(a,a[1:],a[2:]):print(c-abs(j-i)-abs(k-j)+abs(k-i))

Measured memory_bytes: 13804
#include<stdio.h>
#include<stdint.h>
#include<inttypes.h>

typedef int32_t i32;
typedef int64_t i64;

const i32 mod = 1000000007;

i32 inv (i32 a) {
  i32 t = 1;
  while (a > 1) {
    t = (i64) t * (mod - mod / a) % mod;
    a = mod % a;
  }
  return t;
}

i32 comb (i64 n, i64 k) {
  if (k > n - k) k = n - k;
  i64 nu = 1;
  i64 de = 1;
  for (i32 i = 1; i <= k; ++i) {
    nu = nu * (n + 1 - i) % mod;
    de = de * i % mod;
  }
  return nu * inv (de) % mod;
}

void run (void) {
  i64 n, m, k;
  scanf ("%" SCNi64 "%" SCNi64 "%" SCNi64, &n, &m, &k);
  i64 ans = 0;
  i64 c = comb (n * m - 2, k - 2);
  for (i32 d = 1; d < m; ++d) {
    ans = (ans + c * d % mod * (m - d) % mod * n % mod * n) % mod;
  }
  for (i32 d = 1; d < n; ++d) {
    ans = (ans + c * d % mod * (n - d) % mod * m % mod * m) % mod;
  }
  printf ("%" PRIi64 "\n", ans);
}

void gen (void) {
  
}

int main (void) {
  run();
  return 0;
}


Measured memory_bytes: 128
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
#include <complex>
#include <cstdio>
#include <list>

//< in.txt > out.txt
using namespace std;
//std::ios::sync_with_stdio(false);
//std::cin.tie(0);
const long long MOD = 1e9 + 7;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> PLL;
typedef pair<LD, LL> PDL;
typedef pair<LD, LD> PDD;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//typedef boost::multiprecision::cpp_int bigint;

template<class T>
void in(T& x) {
	cin >> x;
}

template<class T1,class T2>
void in(pair<T1, T2>& p) {
	in(p.first);
	in(p.second);
}

template<class T>
void in(vector<T>& v,LL st=-1,LL en=-1) {
	if (st == -1) {
		st = 0;
		en = v.size() - 1;
	}
	for (LL n = st; n <= en; n++) {
		in(v[n]);
	}
}

LL N;
VLL X;

LL calc(LL P) {
	LL ans = 0;
	for (LL n = 0; n < N; n++) {
		ans += (X[n] - P) * (X[n] - P);
	}
	return ans;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	cin >> N;
	X.resize(N);
	in(X);
	LL ans = 1e15;
	for (LL x = 0; x <= 100; x++) {
		ans = min(ans, calc(x));
	}
	cout << ans << "\n";
	return 0;
}

Measured memory_bytes: 256
//----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include<stdlib.h>
#include<stdio.h>
#define test ll t; cin>>t; while(t--)
#define FOR(p,n) for(ll i=p;i<(ll)n;i++)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define endl '\n'
#define vs vector<string>
#define mii map<int,int>
#define msi map<string,int>
#define vpii vector< pair<int, int > >
#define vpsi vector< pair< string ,int > >
#define forci(p,q) for(int i=p;i<q;i++)
ll gcd(ll a,ll b){ if(b==0) return a;    return gcd(b,a%b);}
ll lcm(ll a,ll b) { return (a/gcd(a,b)*b);}
ull power(ull a, ull b) {a %= mod;  ull res = 1;  while (b > 0) { if (b & 1) res = res * a % mod;  a = a * a % mod;  b >>= 1; }  return res%mod; }
ll modmul(ll x, ll y){return (x*y)%mod;}
ll modadd(ll x, ll y){return (x+y)%mod;}
ll modsub(ll x, ll y){return (x-y+mod)%mod;}
ll fact[1000007]={0};
void facto() {fact[0]=1;fact[1]=1;for(int i=2;i<100007;i++)fact[i]=(fact[i-1]*i)%mod;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[r],mod-2)))%mod; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
ll npr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
inline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}
inline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}
inline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}
/*bool prime[MAX];
ull sieve(){memset(prime,true,sizeof(prime));for(ull p=2;p*p<MAX;p++){if(prime[p]==true){for(ull i=2*p;i<MAX;i+=p){prime[i]=false;}}}prime[0]=0;prime[1]=0;
}
int inv[1000001]={0};
void findinverse(){inv[1] = 1;for(int i = 2; i <=1e6 ; ++i)	inv[i] = (mod - (mod/i) * inv[mod%i] % mod) % mod;}
*/
using namespace std;
int solve()
{
	int n;
	cin>>n;
	cout<<pow(n,3)<<endl;


}
signed main()
{
	fastio;
//	test
		solve();
}




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

int main()
{
  int n;
  cin >> n;
  double x[11];
  string u[11];
  for(int i = 0; i < n; i++){
    cin >> x[i] >> u[i];
  }
  double ans = 0;
  for(int i = 0; i < n; i++){
    if(u[i] == "JPY"){
      ans += x[i];
    }
    else{
      ans += x[i] * 380000.0;
    }
  }
  cout << ans << endl;
}

Measured memory_bytes: 256
n = int(input())
a = [int(i) for i in input().split()]
s0 = sum(a)
s = s0//2 + 1 #半分の長さ
y = 0
x = 0
for i in range(n):
    if x >= s:
        y = i-1
        break
    else:
        x += a[i]
a11 = a[:y]
a12 = a[y:]
a21 = a[:y+1]
a22 = a[y+1:]
a11s = sum(a11)
a12s = sum(a12)
a21s = sum(a21)
a22s = sum(a22)
ans = min(abs(a11s-a12s), abs(a21s-a22s))
print(ans)


Measured memory_bytes: 26220
import sys
N,Y = map(int,input().split())
for x in range(N+1):
    for y in range(N+1-x):
        z = N - x - y
        if 10000*x + 5000*y + 1000*z == Y:
            print(x,y,z)
            sys.exit()
print(-1,-1,-1)



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

int main() {
  int num = 5;
  int input[num], table[num], tmp, ans=0, mem, count=0;

  for (int i=0; i<num; i++) {
    cin >> input[i];
    table[i] = 1;
  }
  while (1) {
    int pre=0;
    for (int i=0; i<num; i++) {
      if (table[i]) {
        tmp = ans + input[i];
        //cout << "tmp:" << tmp << endl;
        if (tmp%10 == 0) {
          pre = tmp;
          mem = i;
          break;
        } else if (pre%10 <= tmp%10) {
          pre = tmp;
          mem = i;
        }
        //cout << "pre:" << pre << endl;
      }
    }
    table[mem] = 0;
    count++;
    ans = pre;
    if (count == 5) break;
    if (pre%10 != 0) {
      ans = (pre/10+1)*10;
    }
    //cout << ans << endl;
  }

  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 256
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<functional>
#include<map>
#include<set>
#include <string>
#include <numeric>

using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
map<int, int> mp;
map<int, int>mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l

unsigned gcd(unsigned a, unsigned b) {
	if (a < b) gcd(b, a);
	unsigned r;
	while ((r = a % b)) {
		a = b;
		b = r;
	}
	return b;
}
char tolower(char c) {
	return (c + 0x20);
}
ld num(ld a,ld b) {
	ld c = 1;
	while (b > a) {
		a *= 2;
		c*=2;
	}
	return c;
}

int main() {
	int r, d, x;
	cin >> r >> d >> x;
	rep(i, 10) {
		int ans = r * x - d;
		cout << ans << endl;
		x = ans;
	}
	cin >> r;
}

Measured memory_bytes: 256
//import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Set;
import java.util.HashSet;

public class Main {
    static int[][] map;
    static boolean[][] visited;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] nk = br.readLine().split(" ");
        int n = Integer.parseInt(nk[0]);
        int k = Integer.parseInt(nk[1]);
        String[] str_as = br.readLine().split(" ");
        int[] as = new int[str_as.length];
        int min = 100005;
        int min_index = -1;
        
        for (int i = 0; i < as.length; i++) {
            as[i] = Integer.parseInt(str_as[i]);
            if (min > as[i]) {
                min = as[i];
                min_index = i;
            }
        }
        
        
        
        System.out.println((int)Math.ceil((n-1.0)/(k-1.0)));
    }
}


Measured memory_bytes: 35284
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>b;i--)
#define vint vector<int> 
#define vvint vector<vint>
#define CST(x) cout<<fixed<<setprecision(x)//小数点以下の桁数指定
#define ct(a) cout<<a<<endl
static const double pi = 3.141592653589793;
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int INF = 1e9+7;
const int mod= 1e9 + 7;

ll k[4] = { 3,5,7 };
vector<ll> A;

void dfs(ll cur) {

	//数列の長さがNに達したら終わり
		if (cur>=1e8) {
			//処理
			return;
		}

	for (ll v = 0; v < 3; v++) {
		ll u = 10 * cur + k[v];

		ll c = u;
		bool f[3] = { false,false,false };
		while (c > 0) {
			ll m = c % 10;
			if (m == 3)f[0] = true;
			if (m == 5)f[1] = true;
			if (m == 7)f[2] = true;
			c /= 10;
		}
		if(f[0]&&f[1]&&f[2])A.push_back(u);

		dfs(u);
	}

}

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

	ll N; cin >> N;
	ll ans = 0;

	dfs(0);


	sort(A.begin(),A.end());



	FOR(i, 0,ll(A.size())) {
		if (A[i] <= N) {
			ans++;		
		}
	}
	cout << ans << endl;

	return 0;
}


Measured memory_bytes: 640
while True:
    H, W = (int(x) for x in input().split())
    if (H == 0 and W == 0): break
    for h in range(H):
        for w in range(W):
            if (h == 0 or h == (H - 1)): print("#", end="")
            elif (w == 0 or w == (W - 1)): print("#", end="")
            else: print(".", end="")
        print()
    print()


Measured memory_bytes: 7016
// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-9;
const long double INF=1e+10;
const long double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		// if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
string S,T;
char in[12];

int main(){
	scanf("%s",in);
	S=in;
	scanf("%s",in);
	T=in;
	int a,b;
	scanf("%d%d",&a,&b);
	scanf("%s",in);
	string U=in;
	if(S==U)a--;
	else b--;
	printf("%d %d\n",a,b);
}

Measured memory_bytes: 256
d, g = map(int,input().split())
plist = [list(map(int,input().split())) for i in range(d)]

basiclist = []

problem = [i for i in range(d)]

# print(problem)

for i in range(len(plist)):
    tmplist = [plist[i][0], (plist[i][0])*(i+1)*100+plist[i][1]]
    # problem.append(plist[i][0])
    basiclist.append(tmplist)

# print(basiclist)

import itertools

combs = []

for i in range(1, len(problem)+1):
    els = [list(x) for x in itertools.combinations(problem, i)]
    # print(els)
    combs.extend(els)

# print(combs)

mincount = 2**10+1


for i in range (d):
    for j in range (1, basiclist[i][0]):
        if j*(i+1)*100 >= g:
            mincount = min(mincount, j)


for comb in combs:
    best_remaining_num = -1
    for a in range(d):
        if a not in comb:
            best_remaining_num = max(a, best_remaining_num)
    best_remaining_score = (best_remaining_num+1)*100
    # print(best_remaining_score)
    total_ps = 0
    total_ps_count = 0
    for com in comb:
        total_ps += basiclist[com][1]
        total_ps_count += basiclist[com][0]
    # print(total_ps)
    if best_remaining_num == -1:
        mincount = min(mincount, total_ps_count)
        continue
    for i in range(basiclist[best_remaining_num][0]):
        if total_ps + best_remaining_score*i >= g:
            # print(comb, total_ps_count, total_ps, best_remaining_score, i, total_ps + best_remaining_score * i)
            mincount = min(mincount, i + total_ps_count)
            # print(mincount)
            break

print(mincount)


Measured memory_bytes: 3188
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
    ll N,h,n,w,k,m;
    scanf("%lld",&N);
    int flag=0;
    for(int i=1;i<=3500;i++)
    {
        for(int j=1;j<=3500;j++)
        {
            k=i*j*N;
            m=4*i*j-i*N-j*N;
            if(m!=0&&k%m==0&&k/m>0)
            {
                flag=1;
                h=i;
                n=j;
                w=k/m;
                break;
            }
        }
        if(flag)
            break;
    }
    printf("%lld %lld %lld\n",h,n,w);
    return 0;
}


Measured memory_bytes: 256
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i <(n); i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
vector<int> graph[100005];
ll cnt[100005];

int main()
{
    int n, k;
    cin >> n >> k;
    rep(i, n - 1)
    {
        ll a, b;
        cin >> a >> b;
        a--, b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    queue<ll> que;
    que.push(0);
    // cout << "*********" << endl;
    cnt[0] = 2;
    while (que.size() > 0)
    {
        ll now = que.front();
        que.pop();

        int cc = 0;
        for (auto next: graph[now])
        {
            if (cnt[next] > 0) continue;
            cnt[next] = 2 + cc;
            cc++;
            que.push(next);
            // cout << next <<' ' << cnt[next] << endl;;
        }
    }
    cnt[0] = 0;
    for (auto next : graph[0])
        cnt[next]--;

    ll ans = 1;
    // cout << "*" << endl;
    rep(i, n)
    {
        // cout << cnt[i] << ' ' << i << endl;
        if (k - cnt[i] > 0)
            ans = (ans * (k - cnt[i])) % MOD;
        else
            ans = 0;
    }
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 7672
import sys
input = sys.stdin.readline
def main():
    H, W, K = map(int, input().split())
    field = ['' for _ in range(H)]
    for i in range(H):
        field[i] = input().rstrip()
    num_black = 0
    for i in range(H):
        for j in range(W):
            if field[i][j] == '#':
                num_black += 1
    ans = 0
    for bit in range(2**(H+W)):
        current = 'h'
        target_h = []
        target_w = []
        for i in range(H+W):
            if i < H:
                current = 'h'
            else:
                current = 'w'
            if bit & 1<<i:
                ord = i
                if current == 'w':
                    ord = i - H
                if current == 'h':
                    target_h.append(ord)
                else:
                    target_w.append(ord)
        cnt = 0
        for j in range(H):
            for k in range(W):
                if j in target_h or k in target_w:
                    if field[j][k] == '#':
                        cnt += 1
        if num_black - cnt == K:
            ans += 1
    print(ans)
if __name__ == "__main__":
    main()

Measured memory_bytes: 68524
#include <stdio.h>

int main() {
    int m, f, r, mf;
    char score;
    while(1) {
        scanf("%d %d %d", &m, &f, &r);
        if (m == -1 && f == -1 && r == -1) break;
        mf = m + f;
        if ((m == -1 || f == -1) || mf < 30) score = 'F';
        else if (mf >= 80) score = 'A';
        else if (mf >= 65) score = 'B';
        else if (mf >= 50) score = 'C';
        else if (mf >= 30 && r >= 50) score = 'C';
        else score = 'D';
        printf("%c\n", score);
    }
}


Measured memory_bytes: 2108
#include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcountll(n)

//bool flag = __builtin_add_overflow(a , b , &tmp);
//bool flag = __builtin_mul_overflow(a , b , &tmp);
//bool flag3= __builtin_sub_overflow(a , b , &tmp);

using namespace std;
//using namespace __gnu_cxx;
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const double PI = acos(-1.0), EPS = 1e-6;
const long long inf = 2e12 + 12;
const int MAXN = 10004, MAXM = 102, Mod = 1000000007 , MAXLog = 20;



int main() {
#ifndef ONLINE_JUDGE
//    freopen("input.txt", "rt", stdin);
//    freopen("output.txt", "w", stdout);
#endif
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9), cout << fixed;

    int n, d;
    cin >> n >> d;
    d *= 2;
    ++d;

    cout << (n + d - 1) / d << '\n';

    return 0;
}

Measured memory_bytes: 256
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

n = int(input())

ans = 0
for i in range(n):
    if 1 <= i + 1 <= 9:
        ans += 1
    elif 100 <= i + 1 <= 999:
        ans += 1
    elif 10000 <= i + 1 <= 99999:
        ans += 1
    elif 1000000 <= i + 1 <= 9999999:
        ans += 1

print(ans)


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

#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T = int>
T in() {
  T x;
  cin >> x;
  return (x);
}

typedef long long ll;

int main() {
  string s = in<string>();
  int k = in();

  set<string> se;

  int n = s.size();
  rep(i, n) {
    for (int j = 1; i + j <= n && j <= k; j++) {
      se.insert(s.substr(i, j));
    }
  }

  auto itr = se.begin();
  rep(i, k - 1)++ itr;
  cout << *itr << endl;

  return 0;
}


Measured memory_bytes: 1664
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>

#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef vector<int> vint;
typedef vector<ll> vll;
const ll INF = LLONG_MAX;
const ll MOD = 1e9+7;

int main() {
  int N;cin >> N;
  vll a(N);
  ll ma=-INF;
  int maxi=0;
  repeat(i,N){
     cin >> a[i];
     if(ma < a[i]){
       ma = a[i];
       maxi = i;
     }
  }
  vint ans;
  if(ma <= 0){
    for(int i=N-1;i>maxi;i--){
      ans.push_back(i+1);
    }
    repeat(i,maxi){
      ans.push_back(1);
    }
  }else{
    ll maxx[2]={0,0};
    vector<bool> alive(N,false);
    repeat(i,N){
      if(0<a[i]){
        maxx[i&1] += a[i];
        alive[i] = true;
      }
    }
    bool maxbit= maxx[0]>maxx[1]? 0:1;
    ma = maxx[maxbit];
    //debug(maxbit);
    int M = N;
    for(int i=N-1;i>=0;i--){
      if((i-maxbit)&1) continue;
      if(alive[i]) continue;
      ans.push_back(i+1);
      if(i+1 == M) M--;
      else if(i==0){
        M--;
        maxbit = !maxbit;
      }else M -= 2;
    }
    debug(M);
    for(int i=M-1;i>=0;i--){
      if((i-maxbit)&1) ans.push_back(i+1);
    }
  }
  cout << ma << endl;
  cout << ans.size() << endl;
  repeat(i,ans.size()){
    cout << ans[i] << endl;
  }
  return 0;
}


Measured memory_bytes: 384
#include<iostream>
#include<cmath>
#include<numeric>
#include<string>
#include<algorithm>
#include<vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define int64 long long
#define yokuwaruprime (10*10*10*10*10*10*10*10*10+7)
using namespace std;

int main(){
  int n,k;
  cin>>n>>k;
  int64 h[n];
  rep(i,n){
    cin>>h[i];
  }
  sort(h,h+n);
  int64 ans=10000000000;
  rep(i,n-k+1){
    ans=min(ans,h[i+k-1]-h[i]);
  }
  cout<<ans<<endl;
}


Measured memory_bytes: 1024
#include <bits/stdc++.h>
#define int long long
#define moder 1000000007
#define inf 1000000000000000000
#define rep(i,n) for(int i=0;i<n;i++)
#define P pair<int,int>
#define all(v) v.begin(),v.end()
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;
bool prime(int n) {
	for (int i = 2; i <= sqrt(n); i++) {
		if (n%i == 0)return false;
	}
	return n != 1;
}
int gcd(int x, int y) {
	if (x < y)swap(x, y);
	if (y == 0)return x;
	return gcd(y, x%y);
}
int lcm(int x, int y) {
	return x * y / gcd(x, y);
}
int mod_pow(int x, int y, int mod) {
	int res = 1;
	while (y > 0) {
		if (y & 1) {
			res = res * x%mod;
		}
		x = x * x%mod;
		y >>= 1;
	}
	return res;
}
int kai(int x) {
	if (x == 0)return 1;
	return (kai(x - 1)*x) % moder;
}
int comb(int x, int y) {
	return kai(x)*mod_pow(kai(x - y), moder - 2, moder) % moder*mod_pow(kai(y), moder - 2, moder) % moder;
}
/*--------Library Zone!--------*/

class union_find {
    int par[200005],Rank[200005];
public:
    union_find(int n){
	    rep(i,n){
	    	par[i]=i;
	    	Rank[i]=0;
	    }
    }

    int find(int x){
    	if(par[x]==x)return x;
    	return par[x]=find(par[x]);
    }

    void unit(int x,int y){
    	x=find(x);y=find(y);
    	if(x==y)return;
    	if(Rank[x]<Rank[y]){
    		par[x]=y;
    	}else {
    		par[y]=x;
    		if(Rank[x]==Rank[y])Rank[x]++;
    	}
    }

    bool same(int x,int y){
    	return find(x)==find(y);
    }
};
int n,k,l;
map<P,int>mp;
signed main() {
	cin>>n>>k>>l;
	union_find car(n),train(n);
	rep(i,k){
		 int p,q;
		 cin>>p>>q;
		 car.unit(p-1,q-1);
	}
	rep(i,l){
		int p,q;
		cin>>p>>q;
		train.unit(p-1,q-1);
	}
	rep(i,n){
		mp[{car.find(i),train.find(i)}]++;
	}
	cout<<mp[{car.find(0),train.find(0)}];
	for(int i=1;i<n;i++){
		cout<<" "<<mp[{car.find(i),train.find(i)}];
	}
	cout<<endl;
}



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

int main()
{
  int n,m,i,j,k,pen=0,ans=0;
  string cw;
  cin>>n>>m;
  int prob[n+1];
  for(i=1;i<=n;i++)
    prob[i]=0;

  for(i=1;i<=m;i++)
  {
    cin>>j>>cw;
    if(cw=="WA" && prob[j]!=-1)
    {
      prob[j]++;

    }
    else if(cw=="AC" && prob[j]!=-1)
    {
      ans++;
      pen+=prob[j];
      prob[j]=-1;
    }
  }
  cout<<ans<<" "<<pen<<endl;

}


Measured memory_bytes: 640
using System;

namespace AizuOnline
{
    internal class Program
    {
        private static void Main(string[] args)
        {
            var x = Console.ReadLine().Split(' ');
            var a = Convert.ToInt32(x[0]);
            var b = Convert.ToInt32(x[1]);
            var c = Convert.ToInt32(x[2]);
            if (a < b && b < c)
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }
        }
    }
}

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

int main(){
  int a,b,c;
  cin >> a >> b >> c;
  int k;
  cin >> k;
  rep(i,k){
    if(a>=b) b*=2;
    else c*=2;
  }
  if(a<b && b<c) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}


Measured memory_bytes: 3632
#include<bits/stdc++.h>
using namespace std;
int main(){
  
  int H,W;
  cin >> H >> W;
  
  vector<vector<char>> a(H,vector<char>(W));
  
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin >> a.at(i).at(j);
    }
  }
  
  bool finished=false;
  
  while(finished==false){
    finished=true;
    for(int i=0;i<H;i++){
      bool t=true;
      
      for(int j=0;j<W;j++){
        if(a.at(i).at(j)=='#'){
          t=false;
        }
      }
      
      if(t==true){
        for(int j=i;j<H-1;j++){
          for(int k=0;k<W;k++){
            a.at(j).at(k)=a.at(j+1).at(k);
          }
        }
        
        H--;
        finished=false;
      }
      
    }
    
    for(int i=0;i<W;i++){
      bool t=true;
      
      for(int j=0;j<H;j++){
        if(a.at(j).at(i)=='#'){
          t=false;
        }
      }
      
      if(t==true){
        for(int j=i;j<W-1;j++){
          for(int k=0;k<H;k++){
            a.at(k).at(j)=a.at(k).at(j+1);
          }
        }
        
        W--;
        finished=false;
      }
    }
  }
  
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cout << a.at(i).at(j);
      if(j==W-1){
        cout << endl;
      }
    }
      
  }
  
}

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


int main() {
    int a,b,c,k;
    cin>>a>>b>>c>>k;
    bool ok=false;
    for(int x=1;x<=k;x++){
        int red=a,green=b,blue=c;
        int A=blue*pow(2,x),B=green*pow(2,k-x);
        if(A>B and B>red) ok=true;
    }
    if(ok) cout<<"Yes"<<endl;
    else
    {
        cout<<"No"<<endl;
    }
    
    
}

Measured memory_bytes: 3876
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;


int main(){
  int N, K;
  cin >> N >> K;
  int pos = -1;
  rep(i,N){
    int a;
    cin >> a;
    if(a == 1) pos = i;
  }

  int ret = 1000000;
  rep(i,K){
    if(pos - i < 0) continue;
    if(pos - i + K > N) continue;

    int a = pos-i;
    int b = pos-i+K-1;

    int cntA = (a + K-1-1)/(K-1);
    int cntB = (N-1-b + K-1-1)/(K-1);

    //cout << i << " " <<  a << " " << b << " " << cntA << " " << cntB << endl;
    
    ret = min(ret, 1+cntA+cntB);
  }

  cout << ret << endl;
  
  return 0;
}




Measured memory_bytes: 256
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define INF 1LL<<62
using namespace std;
ll A,B,C,D,n,sm,l,r;

inline int read()
{
	int n=0,f=1; char c=getchar();
	while (c<'0' || c>'9') {if(c=='-')f=-1; c=getchar();}
	while (c>='0' && c<='9') {n=n*10+c-'0'; c=getchar();}
	return n*f;
}

inline void rw(ll& x,ll y) {x=min(x,y);}

int main()
{
	int i;
	n=read(); A=read(); B=read(); C=read(); D=read();
	l=r=abs(A-B); ++n;
	if (n&1) {l-=D; r-=C; if (r<0) l=-l,r=-r,swap(l,r); --n;}
	n-=2;
	for (i=1;i<=(n/2);++i)
	{
		if (l<=0) return 0*printf("YES");
		if ((D-C)*(n/2-i+1)>=l) return 0*printf("YES");
		l-=D+D; r-=C+C;
		if (r<0) l=-l,r=-r,swap(l,r);
	}
	if (l<=0) return 0*printf("YES"); else printf("NO");
}

Measured memory_bytes: 128
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const llint big=1e15+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
//template<class T> void SO(T& ve){sort(T.begin(),T.end());}
int main(void){
	int n,a;cin>>n>>a;cout<<n*n-a<<endl;
}

Measured memory_bytes: 256
use proconio::input;

fn main() {
    input! {
        n: usize,
    };
    let x = n * 100 / 108;
    for x_i in x.saturating_sub(1)..=x + 1 {
        if x_i * 108 / 100 == n {
            println!("{}", x_i);
            return;
        }
    }
    println!(":(");
}


Measured memory_bytes: 2084
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=j; i<=k; i++)
#define FFOR(i, j, k) for(int i=j; i<k; i++)
#define DFOR(i, j, k) for(int i=j; i>=k; i--)
#define bug(x) cerr<<#x<<" = "<<x<<'\n'
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
template <typename T> inline void read(T &x){
    char c;
    bool nega=0;
    while((!isdigit(c=getchar()))&&(c!='-'));
    if(c=='-'){
        nega=1;
        c=getchar();
    }
    x=c-48;
    while(isdigit(c=getchar())) x=x*10+c-48;
    if(nega) x=-x;
}
template <typename T> inline void writep(T x){
    if(x>9) writep(x/10);
    putchar(x%10+48);
}
template <typename T> inline void write(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    writep(x);
}
template <typename T> inline void writeln(T x){
    write(x);
    putchar('\n');
}
#define taskname "D"
int n;
string s, t;
void check(string t){
    int same=0;
    FFOR(i, 1, n-1){
        same=(s[i]=='o');
        if(t[i]=='W') same=1-same;
        if(same) t+=t[i-1];
        else t+=(char('S'+'W'-t[i-1]));
    }
    same=(s[0]=='o');
    if(t[0]=='W') same=1-same;
    if((t[1]==t[t.size()-1])!=same) return;
    same=(s[t.size()-1]=='o');
    if(t[t.size()-1]=='W') same=1-same;
    if((t[0]==t[t.size()-2])!=same) return;
    cout<<t;
    exit(0);
}
int cnt;
int main(){
    #ifdef Megumin
        if(fopen(taskname".inp", "r"))
            freopen(taskname".inp", "r", stdin);
    #endif // Megumin
    cin>>n>>s;
    check("SS");
    check("SW");
    check("WS");
    check("WW");
    puts("-1");
}

Measured memory_bytes: 640