akhauriyash/Code-Regression huggingface dataset:
N = int(input())
A = list(map(int, input().split(" ")))

def bubblesort(A, number):
    flag = True
    count, change = 0, 0
    while flag:
        flag = False
        for i in range(1, number-count):
            if A[-i-1] > A[-i]:
                A[-i-1], A[-i] = A[-i], A[-i-1]
                flag = True
                change += 1
        count += 1
    return print(*A), print(change)

bubblesort(A, N)


Measured memory_bytes: 5612
#include <cstdio>
#include <utility>
#include <cctype>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;

#ifdef __linux
#define _U(s) s##_unlocked
#else
#define _U(s) _##s##_nolock
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
#define gcu _U(getchar)
#define pcu _U(putchar)
#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept
#define _T template <typename T>
#define _HT template <typename H,typename... T>
#define _OP(t) inline operator t()
struct _in {
#ifdef _GLIBCXX_STRING
	_OP(string){string s;char c;while(isspace(c = gcu()));do{s+=c;}while(c=gcu(),c!=' '&&c!='\n'&&c!=EOF);return s;}
#define _S
#endif
	_OP(char){char c=gcu();gcu();return c;}
	_OP(double){double d; scanf("%lf",&d); gcu();return d;}
	_T _OP(T){T n{},m{1},c;while(isspace(c = gcu()));if(c=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}
} in;
#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)
#ifdef _S
_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}
#endif
_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}
_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}
#define _OUT(...) _DEF(void,out,__VA_ARGS__)
#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)
_OUT(bool b){pcu('0'+b);}
_OUT(const char *s){while(*s)pcu(*s++);}
_OUT(char c){pcu(c);}
#ifdef _S
_OUT(string &s){for(char c:s)pcu(c);}
#endif
_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;
	if(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}
_OUTL(){out('\n');}
#ifdef _GLIBCXX_VECTOR
	_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);}
#endif
	_HT _OUT(H &&h, T... t){out(h);out(t...);}
	template <typename... T> _OUTL(T... t){out(t...);outl();}
	struct range{
		int e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}
		struct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}
			it& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};
#define times(i,n) for(int i=n;i;i--)

template <typename T>
using V = vector<T>;

int main() {
	int n {in};
	V<V<int>> d(n, V<int>(n, INT_MAX / 2));
	range rn(n);
	times (i, n) {
		int t {(int) in - 1};
		times(j, in)
			d[t][(int) in - 1] = 1;
	}
	for (int k: rn)
		for (int i: rn)
			for (int j: rn)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
	times(i, in) {
		int s {(int) in - 1}, e {(int) in - 1}, v {in};
		if (d[s][e] < v)
			outl(d[s][e] + 1);
		else
			outl("NA");
	}
}


Measured memory_bytes: 2728
#include <bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define FOR(i, a, b) for (ll i = (signed)(a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define MOD 1000000007
#define INF 93193111451418101
#define MIN -93193111451418101
#define EPS 1e-11
using namespace std;
typedef pair<ll, ll> P;
typedef pair<ll, P> TP;
int main() {
  ll n;
  map<char, P> m;
  m['N'] = P(0, 1);
  m['W'] = P(-1, 0);
  m['E'] = P(1, 0);
  m['S'] = P(0, -1);
  while (cin >> n && n) {
    bool f[21][21] = {};
    REP(i, n) {
      ll x, y;
      cin >> x >> y;
      f[x][y] = 1;
    }
    ll c;
    cin >> c;
    ll x = 10, y = 10;
    f[10][10] = 0;
    REP(i, c) {
      char h;
      ll cnt;
      cin >> h >> cnt;

      REP(j, cnt) {
        f[x + m[h].first][y + m[h].second] = 0;
        x = x + m[h].first;
        y = y + m[h].second;
      }
    }
    bool fl = 0;
    REP(i, 21) {
      REP(j, 21) {
        if (f[i][j])
          fl = 1;
      }
    }
    cout << (fl ? "No" : "Yes") << endl;
  }
}



Measured memory_bytes: 3084
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
typedef long long   ll;
#define pb                push_back
#define mp                make_pair
#define all(a)            (a).begin(), (a).end()
#define clr(a,h)          memset(a, (h), sizeof(a))
#define mem(a,h)          memset(a, (h), sizeof(a))
#define fi first
#define se second
#define por(a,b) (((a%MOD) * (b%MOD))%MOD)
#define forg(i, b, e, c)    for (ll i = (ll)b; i < (ll)e; i+=c)
#define forr(i, b, e)    for (ll i = b; i < e; i++)
 
 
using namespace std;
//using namespace __gnu_pbds;
typedef double lldb;
typedef pair<ll, ll>  ii;
typedef pair<ll, ii>  iii;
typedef vector<ll>     vi;
typedef vector<vi>     vvi;
typedef vector<ii>      vii;
typedef vector<ll>      vll;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll INF = 1e9;
const double PI = acos(-1);
#define tam 120000
#define tam2 200000
#define offset 
const ll MOD= 998244353;
int main()
{
    int n,m;
    cin>>n>>m;
    int valor;
    forr(i,0,m)
    {
        cin>>valor;
        n-=valor;

    }
    n=max(n,-1);
    cout<<n<<endl;
}
// PLUS ULTRA!


Measured memory_bytes: 3608
from itertools import accumulate

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return is_prime

p_list = primes(10 ** 5)
cnt = [0] * (10 ** 5 + 2)
for i in range(1, (10 ** 5 + 1), 2):
    if p_list[i] and p_list[(i + 1) // 2]:
        cnt[i] += 1
cnt_sum = list(accumulate(cnt))

q = int(input())
for _ in range(q):
    li, ri = map(int, input().split())
    print(cnt_sum[ri] - cnt_sum[li - 1])

Measured memory_bytes: 8100
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2e5 + 555;
const int MOD = 1e9 + 7;
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    cout << fixed;
    ll a, v, b, w, t;
    cin >> a >> v >> b >> w >> t;
    ll dis = abs(a - b);
    if (a == b) {
        cout << "YES" << '\n';
    } else if (v <= w) {
        cout << "NO" << '\n';
    } else {
        cout << (dis <= t * abs(w - v) ? "YES" : "NO") << '\n';
    }
    return 0;
}


Measured memory_bytes: 3608
function Main(input) {
	var inputdata = input.split(/\s/);
    var K = parseInt(inputdata[0]);
    var X = parseInt(inputdata[1]);
    var start = X-K+1;
    var end = X+K;
	for (var i = start; i < end; i++) {
		console.log(i);
	}
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));

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

#define INF INT_MAX
typedef long long ll;

using namespace std;

int main(void){
	int n;
	cin >> n;
	ll sum = 0;
	vector<ll> a(n,0);
	for(int i = 0;i < n;i++){
		cin >> a[i];
		sum += a[i];
	}
	ll  min = 1000000000000000000LL;
	ll sumX = 0; 
	for(int i = 0;i < n- 1;i++){
		sumX += a[i];
		ll temp = abs(2*sumX - sum);
		min = min > temp ? temp : min;
	}
	cout << min << endl;
	return 0;
}

Measured memory_bytes: 1792
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  ll a;

  cin >> a;

  cout << a + a * a + a * a * a;

  return 0;
}
/*

*/


Measured memory_bytes: 3688
#include <iostream>
#include <string>

using namespace std;

int main(){
        string s;
        int ans;
        cin >> s ;
        if(s == "RRR"){
                ans = 3;
        }else if(s == "RRS" or s == "SRR"){
                ans = 2;
        }else if(s == "SSS"){
                ans = 0;
        }else{
                ans = 1;
        }
        cout << ans << endl;
}

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

int main(){
    int n,m,c,sum=0,s,an;
    cin >> n >> m >> c;
    vector<int> b(m);
    vector<int> a(m);

    for(int i=0;i<m;i++){
        cin >> b.at(i); 
    }

    for(int i=0;i<n;i++){
        s=0;
        for(int l=0;l<m;l++){
            cin >> a.at(l);
            s+=a.at(l)*b.at(l);
        }
        an=s+c;
        if(an>0){
            sum++;
        }
    }
    cout << sum << endl;
}

Measured memory_bytes: 256
n,*z=[*$<].map{|i|i.split.map &:to_i}
p (1..1023).map{|b|eval z[0...n[0]].map{|i|i*''}.zip(z[n[0]..-1]).map{|y,x|x[(b&y.to_i(2)).to_s(2).count ?1]}*?+}.max

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

int main()
{
	int count[26] = {};

	char ch;
	
	while (cin >> ch)
	{
		if ('a' <= ch && ch <= 'z')
		{
			int num = ch - 'a';
			count[num]++;
		}
		else if ('A' <= ch && ch <= 'z')
		{
			int num = ch - 'A';
			count[num]++;
		}
	}

	ch = 'a';

	for (int i = 0; i < 26; i++){
		cout << (char)(ch + i) << " : " << count[i] << endl;
	}
	return 0;
}

Measured memory_bytes: 3016
#include <stdio.h>
#include <vector>
using namespace std;

struct ans_t {
  int x, y, z;

  ans_t(int _x, int _y, int _z) {
    x = _x;
    y = _y;
    z = _z;
  }
};

int main() {
  int n;
  scanf("%d", &n);
  int adder, start, v;
  vector<ans_t> ans;
  for (int bit = 25; bit >= 0; bit--) {
    if (n & (1 << bit)) {
      adder = (1 << bit);
      start = bit;
      for (int i = 0; i < bit; i++) {
        ans.push_back(ans_t(i + 1, i + 2, 0));
        ans.push_back(ans_t(i + 1, i + 2, (1 << i)));
        v = i + 2;
      }
      break;
    }
  }
  for (int bit = start - 1; bit >= 0; bit--) {
    if (n & (1 << bit)) {
      ans.push_back(ans_t(bit + 1, v, adder));
      adder += (1 << bit);
    }
  }
  printf("%d %d\n", v, (int) ans.size());
  for (int i = 0; i < (int) ans.size(); i++) {
    printf("%d %d %d\n", ans[i].x, ans[i].y, ans[i].z);
  }
  return 0;
}

Measured memory_bytes: 256
// Problem : B - ... (Triple Dots)
// Contest : AtCoder - AtCoder Beginner Contest 168
// URL : https://atcoder.jp/contests/abc168/tasks/abc168_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=(int)n;i++)
#define REP(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
#define mod 1000000007
int lcm(int x,int y){
	return x/__gcd(x,y)*y;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    string s;
    cin>>s;
    int d=s.length();
    if(d<=n){
    	cout<<s<<endl;
    }else{
    		cout<<s.substr(0,n)+"..."<<endl;
    }
    return 0;
}


Measured memory_bytes: 3652
#include<bits/stdc++.h>
using namespace std;
// マクロ
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
// 型エイリアス
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vvs = vector<vs>;

int main() {
    int n, k;
    cin >> n >> k;
    int ans = 1;
    for(int i = 0; i < n; i++) {
        ans = min(2 * ans, ans + k);
    }
    cout << ans << endl;
}

Measured memory_bytes: 3584
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <sstream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <numeric>
#include <bitset>
#include <ext/algorithm>
#include <ext/numeric>
#define ffor(_a,_f,_t) for(int _a=(_f),__t=(_t);_a<__t;_a++)
#define all(_v) (_v).begin() , (_v).end()
#define sz size()
#define pb push_back
#define SET(__set, val) memset(__set, val, sizeof(__set))
#define FOR(__i, __n) ffor (__i, 0, __n)
typedef long long LL; using namespace std;

int main() {
	int K;
	string str;
	cin >> str >> K;
	FOR (i, str.sz) {
		if (str[i] == 'a')
			continue;
		int diff = 26 - (str[i] - 'a');
		if (diff <= K) {
			str[i] = 'a';
			K -= diff;
		}
	}
	K %= 26;
	int l = str.sz - 1;
	FOR (i, K) {
		str[l]++;
		if (str[l] == 'z' + 1)
			str[l] = 'a';
	}
	cout << str << endl;
	return 0;
}

Measured memory_bytes: 512
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
//cout << setprecision(20) << 

int main() {
    ll N; cin >> N;
    map<ll, ll> input_numbers;
    vector<ll> v(N);
    for (int i = 0; i < N; ++i) {
        cin >> v[i];
        if (!input_numbers.count(v[i])) {
            input_numbers[v[i]] = 0;
        }
        input_numbers[v[i]]++;
    }
    map<ll, ll> already_seen;
    sort(v.begin(), v.end());

    ll ans = 0;
    for (int i = 0; i < N; ++i) {
        ll num = v[i];
        // cout << "looking at " << num << endl;
        // for (auto j : already_seen) {
        //     cout << j.first << " ";
        // }
        // cout << endl;
        bool ok = true;
        // 重複があればダメ
        if (input_numbers[num] > 1) ok = false;
        // 約数がすでに出現していない
        for (ll j = 1; j * j <= num; j++) {
            if (num % j == 0) {
                // cout << "約数 " << j << endl;
                if (already_seen.count(j) || already_seen.count(num / j)) {
                    ok = false;
                    break;
                }
            }
        }
        if (ok) ans++;
        already_seen[num] = 1;
        // cout << ok << endl;
    }
    cout << ans << endl;
}

Measured memory_bytes: 29920
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1000000007;
template<class T> void print(const T& t){ cout << t << endl; }
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; }

int main(){
  ll k, a, b;
  cin >> k >> a >> b;
  bool an = false;
  for (ll i = a; i <= b;i++){
    if(i%k==0){
      an = true;
    }
  }
  if(an){
    print("OK");
  }
  else{
    print("NG");
  }
}

Measured memory_bytes: 3596
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <queue>
#include <stack>
#include <list>
#include <functional>
#include <numeric>
#include <iostream>
 
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
 
int main(){
  int H, W;
  char S[123][123];
  scanf("%d %d", &H, &W);
  rep(i, H) scanf("%s", &S[i]);
  bool can = true;
  rep(i, H) rep(j, W){
    if(S[i][j] == '#'){
      if((i == 0 || S[i - 1][j] == '.') &&
         (i == H || S[i + 1][j] == '.') &&
         (j == 0 || S[i][j - 1] == '.') &&
         (j == W || S[i][j + 1] == '.')) can = false;
    }
  }
  if(can) printf("Yes\n");
  else printf("No\n");
  
  return 0;
}

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

using namespace std;

int main() {
    int n;
    cin >> n;
    if (n % 10 == 7 || n / 10 % 10 == 7 || n / 100 % 10 == 7) {
        puts("Yes");
    } else {
        puts("No");
    }
    return 0;
}

Measured memory_bytes: 3632
#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long

const int MOD = (int)1e+9 + 7;

signed main(){
	int n, m;
	cin >> n >> m;
	vector<int> x(n), y(m);
	for(int i = 0; i < n; ++i) {
		cin >> x[i];
	}
	for(int j = 0; j < m; ++j) {
		cin >> y[j];
	}
	int a, b;
	a = b = 0;
	for(int i = 0; i < n; ++i) {
		a += ((x[i + 1] - x[i]) % MOD * ((i + 1) * (n - i - 1)) % MOD) % MOD;
		a %=  MOD;
	}
	for(int i = 0; i < m; ++i) {
		b += ((y[i + 1] - y[i]) % MOD * ((i + 1) * (m - i - 1)) % MOD) % MOD;
		b %=  MOD;
	}
	cout << (a * b) % MOD << endl;
	return 0;
}


Measured memory_bytes: 1792
#pragma region
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (long long i = a; i <= n; ++i)
#define per(i, a, n) for (long long i = n; i >= a; --i)
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
template <typename T>
void read(T &x) {
    x = 0;
    char ch = getchar();
    ll f = 1;
    while (!isdigit(ch)) {
        if (ch == '-') f *= -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        x = x * 10 + ch - 48;
        ch = getchar();
    }
    x *= f;
}
using namespace std;
/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 */

#pragma endregion
const int maxn = 1e5 + 5;
int n, m;
vector<int> g[maxn];
int dp[maxn], in[maxn];
int main() {
    IO;
    cin >> n >> m;
    while (m--) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        in[y]++;
    }
    queue<int> q;
    rep(i, 1, n) if (!in[i]) q.push(i);
    int ans = 0, sz = q.size();
    while (q.size()) {
        int now = q.front();
        q.pop();
        for (auto nex : g[now]) {
            in[nex]--;
            if (!in[nex])
                q.push(nex);
        }
        --sz;
        if (!sz) {
            sz = q.size();
            ans++;
        }
    }
    cout << ans - 1 << endl;
}

Measured memory_bytes: 9296
n,k=map(int,input().split())
p = [0]*26
for _ in range(n):
    s = input()
    p[ord(s[0])-ord('A')] += 1
p = list(sorted(p, reverse=True))
ans = 0
while p[0] > 0:
    for i in range(k):
        p[i] -= 1
    p = list(sorted(p, reverse=True))
    if p[25] < 0:
        break
    ans += 1
print(ans)

Measured memory_bytes: 44120
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define yesno(flg) if(flg){cout<<'YES'<<endl;}else{cout<<'NO'<<endl;}
#define vi vector<int>
#define pb push_back
#define i197 1000000007
#define MAX_N 200002
using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<Pii,int> Piii;
typedef pair<int,ll> Pil;
typedef pair<ll,ll> Pll;
typedef pair<string,int> Psi;
typedef pair<Psi,int> Psii;

const int inf=1000000000;
struct edge{
	int myc,to,c,cost;
};
struct pos{
	int to,cost,color;
};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

vector<string> v;

int main() {
	string s;
	int n;
	cin>>n>>s;
	if(n<3200){
		cout<<"red"<<endl;
	}else{
		cout<<s<<endl;
	}
	return 0;
}


Measured memory_bytes: 256
/**
 * @copyright (c) 2020 Daisuke Hashimoto
 */

#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;

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

  int64_t N, K;
  cin >> N >> K;
  // const int64_t L = static_cast<int64_t>(T.length());
  vector<int64_t> D(K);
  for (int64_t i = 0; i < K; ++i) {
    cin >> D[i];
  }
  auto IsOkay = [&](const int64_t n) -> bool {
    int64_t temp = n;
    do {
      const int64_t digit = temp % 10;
      for (const auto &comp : D) {
        if (digit == comp) {
          return false;
        }
      }
      temp /= 10;
    } while (temp > 0);
    return true;
  };

  for (int64_t i = N; i <= N * 20; ++i) {
    if (IsOkay(i)) {
      cout << i << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}


Measured memory_bytes: 3636
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef ll int__;
#define rep(i,j) for(int__ (i)=0;(i)<(j);(i)++)
#define repeat(i,j,k) for(int__ i=(j);i<(k);(i)++)
#define all(v) v.begin(),v.end()

#define DIRTY 1
#define CLEAN 0

int main()
{
    ios::sync_with_stdio(false);
    int H,W;
    cin>>H>>W;
    vector<vector<int>> T(H,vector<int>(W));
    rep(y,H)rep(x,W){
        cin>>T[y][x];
    }
    int ans=0;
    vector<vector<int>> DP(H,vector<int>(W));
    rep(y,H){
        DP[y][0]=(T[y][0]==0?1:0);
        ans=max(ans,DP[y][0]);   
    }
    rep(x,W){
        DP[0][x]=(T[0][x]==0?1:0);
        ans=max(ans,DP[0][x]);   
    }
    
    rep(y,H){
        if(y==0)continue;
        rep(x,W){
            if(x==0)continue;
            if(T[y][x]==DIRTY){
                DP[y][x]=0;
            }else{
                DP[y][x]=min(DP[y-1][x]  , DP[y][x-1]);
                DP[y][x]=min(DP[y-1][x-1], DP[y][x]);
                DP[y][x]+=1;
            }
            ans=max(ans,DP[y][x]);
        }
    }
    cout<< ans*ans <<endl;
    return 0;
}

Measured memory_bytes: 16572
#include <iostream>
#include <set>
#define llint long long

using namespace std;

llint n;
llint a[10005], b[10005];
set<llint> S;

int main(void)
{
	cin >> n;
	for(llint i = n; i >= 0; i--) cin >> b[i];
	
	llint k = 0;
	for(llint i = 0; i <= n; i++){
		if(b[i]){
			k = i;
			break;
		}
	}
	for(llint i = 0; i <= n-k; i++) a[i] = b[i+k];
	n -= k;
	
	llint m = abs(a[0]);
	for(llint i = 1; i*i <= m; i++){
		if(m%i) continue;
		S.insert(i), S.insert(m/i);
	}
	for(int i = 1; i <= n+1; i++) S.insert(i);
	
	for(auto p : S){
		bool flag = true;
		if(p == 1) flag = false;
		for(llint i = 2; i*i <= p; i++){
			if(p % i == 0){
				flag = false;
				break;
			}
		}
		if(!flag) continue;
		
		for(llint i = 0; i <= n; i++){
			b[i] = a[i];
			if(b[i] < 0) b[i] = p - (-b[i]) % p;
			b[i] %= p;
		}
		for(llint i = n; i >= p-1; i--){
			if(b[i] == 0) continue;
			if(k == 0 && i == p-1) continue;
			b[i-(p-1)] += b[i], b[i-(p-1)] %= p;
			b[i] = 0;
		}
		
		flag = true;
		for(llint i = 0; i <= n; i++){
			if(b[i]) flag = false;
		}
		if(flag) cout << p << endl;
	}
	return 0;
}

Measured memory_bytes: 896
import numpy as np

A,B,H,M=list(map(float,input().split(" "))) # 前2つが針の長さ、後ろ2つが時分

### AとBのなす角を算出
Hd=float((H%12)*30+M*0.5) # 時針の角度、分を考慮
Md=float((M%60)*6) # 時針の角度
Dd=abs(Hd-Md) # 角度（度数）
Dr=np.deg2rad(Dd) # 角度（ラジアン）

# 長さを求める関数
def calc(a,b,rad):
    return np.sqrt(a**2+b**2-2*a*b*np.cos(Dr))

print(calc(A,B,Dr))

Measured memory_bytes: 27212
package main

import (
	"fmt"
	"math"
)

func main() {

	var a, b, c int
	fmt.Scan(&a, &b, &c)

	x := a - (b + c)

	if x > 0 {
		fmt.Println(0)
	} else {
		fmt.Println(math.Abs(float64(x)))
	}

}


Measured memory_bytes: 512
import math
A,B,H,M=map(int,input().split())
shi_ta1=(M/60)*360
shi_ta2=((H*60+M)/720)*360
shi_ta=shi_ta1-shi_ta2
answer=math.sqrt(A**2+B**2-2*A*B*math.cos(math.radians(shi_ta)))
print(answer)

Measured memory_bytes: 9504
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
class Solve {
public:
    void input() {

    }

    void solve() {
        input();
        int N;
        cin >> N;

        vector<pair<ll, ll>> AB(N);
        rep(i, 0, N) {
            cin >> AB[i].first >> AB[i].second;
        }

        sort(all(AB), [](auto a, auto b) {
//            return (a.second - a.first) < (b.second - b.first);
            return a.second < b.second;
        });

        ll last = 0;
        bool ok = true;
        for (auto e : AB) {
            ll a = e.first, b = e.second;
            last += a;
            if (last > b) {
                ok = false;
            }
//            cout << a << " " << b << " ";
//            cout << last << " " << ok << endl;
        }

        if (ok) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


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

void trace(int a[], int N) {
	for (int i = 0; i < N; i++) {
		printf("%d", a[i]);
		if (i < N - 1) printf(" ");
	}
	printf("\n");
	return;
}

int selectionsort(int a[], int N) {
	int cnt = 0;
	for (int i = 0; i < N - 1; i++) {
		int minj = i;
		for (int j = i + 1; j < N; j++) {
			if (a[j] < a[minj]) minj = j;
		}
		int temp = a[i]; a[i] = a[minj]; a[minj] = temp;
		if (i != minj) cnt++;
	}
	return cnt;
}

int main() {
	int N; scanf("%d", &N);
	int a[N];
	for (int i = 0; i < N; i++) {
		scanf("%d", &a[i]);
	}
	int cnt = selectionsort(a, N);
	trace(a, N);
	printf("%d\n", cnt);
	return 0;
}


Measured memory_bytes: 3228
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1010;
const int MOD = 1e9+7;
int n,cnt = 0;
string s;
bool judge(int x){
	string pin = to_string(x);
	int len = pin.size();
	for(int i = len;i < 3;i++){
		pin = '0'+pin;
	}
	int ct = 0;//记录pin的当前位置
	for(int i = 0; i < n;i++){
		if(pin[ct] == s[i]&& ct < 3){
			ct++;
		}
		if(ct == 3)
			return 1;
	}
	return 0;
}
int main() {
	cin >> n >> s;
	for(int i = 0; i <= 999;i++){
		if(judge(i))
			cnt++;
	}
	cout << cnt <<endl;
    return 0;
}

Measured memory_bytes: 256
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
class Main{
	public static void main(String[] args){
	int x =0;
	int y =0;
	int t =0;
	Scanner scan = new Scanner(System.in);
	ArrayList<Integer> listx = new ArrayList<Integer>();
	ArrayList<Integer> listy = new ArrayList<Integer>();
		while(scan.hasNextLine()){
			x = scan.nextInt();			
			y = scan.nextInt();
			
			if(x==0 && y==0){
				break;
			}
			else{
				if(x>y){
					t=x;
					x=y;
					y=t;
				}
				listx.add(x);			
				listy.add(y);
			}
		}
		for(int i=0;i<listx.size();i++){
			System.out.println(listx.get(i)+" "+listy.get(i));
		}
	}
}

Measured memory_bytes: 46712
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#define ll          long long
#define pb          push_back
#define INF         -92233726854775807ll
#define    endl        '\n'
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define rep(i,a,b)    for(ll int i=a;i<b;i++)
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define lower(u)    transform(u.begin(), u.end(), u.begin(), ::tolower);//convert string u to lowercase;
#define upper(u)    transform(u.begin(), u.end(), u.begin(), ::toupper);
#define time        cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;

using namespace __gnu_pbds; 
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define N 200005
ll l[N],r[N],arr[N],n,m;
vi a(N),seg(4*N),lazy(4*N),in[N],out[N];
void push(ll n)
{
    seg[2*n]+=lazy[n];
    seg[2*n+1]+=lazy[n];
    lazy[2*n+1]+=lazy[n];
    lazy[2*n]+=lazy[n];
    lazy[n]=0;
}
void update(ll n,ll l,ll r,ll low,ll high,ll val)
{
    if(l>high||low>r)
        return;
    if(low<=l&&r<=high)
    {
        seg[n]+=val;
        lazy[n]+=val;
        return;
    }
    push(n);
    ll mid=(l+r)>>1;
    update(2*n,l,mid,low,high,val);
    update(2*n+1,mid+1,r,low,high,val);
    seg[n]=max(seg[2*n],seg[2*n+1]);
}
ll query(ll n,ll l,ll r,ll low,ll high)
{
    if(l>high||low>r)
        return INF;
    if(low<=l&&r<=high)
    {
        return seg[n];
    }
    push(n);
    ll mid=(l+r)>>1;
    return max(query(2*n,l,mid,low,high),query(2*n+1,mid+1,r,low,high));
    
}
void solve()
{
    cin>>n>>m;
    rep(i,0,m)
    {
        cin>>l[i]>>r[i]>>arr[i];
        in[l[i]].pb(i);
        out[r[i]].pb(i);
    }
    ll ans=0;
    ll k=0,j=0;
    rep(i,1,n+1)
    {
        for(auto u:in[i])
            update(1,1,n,1,i,arr[u]);
        ll cur=query(1,1,n,1,i);
        for(auto u:out[i])
        {
            update(1,1,n,1,l[u],-arr[u]);
        }
        update(1,1,n,i+1,i+1,cur);
        ans=max(ans,cur);
    }
    cout<<ans<<endl;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int TESTS=1;
//    cin>>TESTS;
    while(TESTS--)
    {
        solve();
    }
    time
    return 0;
}

Measured memory_bytes: 43844
n=int(input())
info=[["M",0],["A",0],["R",0],["C",0],["H",0]]
kind=0
for i in range(n):
    s=input()
    for i in range(5):
        if s[0]==info[i][0]:
            if info[i][1]==0:
                kind+=1
            info[i][1]+=1
            break
if kind<=2:
    print(0)
else:
    kind_num=[] #1人以上いるグループの人数を記録
    for i in range(5):
        if info[i][1]!=0:
            kind_num.append(info[i][1])
    all_=[]
    for i in range(kind):
        for j in range(kind):
            if j<=i:
                continue
            for k in range(kind):
                if k<=j:
                    continue
                all_.append([i,j,k])
    ans=0
    for i in range(len(all_)):
        ans+=kind_num[all_[i][0]]*kind_num[all_[i][1]]*kind_num[all_[i][2]]
    print(ans)

Measured memory_bytes: 3064
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>

using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)

int main() {
    int h, w;
    cin >> h >> w;
    vector<vector<char>> hw(h, vector<char>(w));
    queue<pair<int, int>> que;
    int cnt = 0;
    rep(i, h) rep(j, w) {
        cin >> hw[i][j];
        if (hw[i][j] == '#') {
            que.push(make_pair(i, j));
            ++cnt;
        }
    }
    int ans = 0;
    int dx[4] = {1, -1, 0, 0};
    int dy[4] = {0, 0, 1, -1};
    while(!que.empty()) {
        pair<int, int> now = que.front(); que.pop();
        --cnt;
        rep(ri, 4) {
            int y = now.first + dy[ri];
            int x = now.second + dx[ri];
            if (y < 0 || y >= h || x < 0 || x >= w) continue;
            if (hw[y][x] == '#') continue;
            hw[y][x] = '#';
            que.push(make_pair(y, x));
        }
        //cout << cnt << " " << que.size() << endl;
        if (cnt == 0 && !que.empty()) {
            ++ans;
            cnt = que.size();
        }
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 12272
/*
  GOOD is not Enough
  You've got to be GREAT.
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n;i++)
#define fr(i,k,n) for(int i=k;i>=n;i--)
#define pb push_back
#define pii pair<int,int>
#define dbg(x) cout << (#x) << " is " << (x) << '\n' 
#define F first
#define S second
#define all(a) a.begin(),a.end()
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

const double pi=3.142857;

void solve()
{ 
  int n,m;
  int sum=0;
  cin >> n >> m;
  f(i,m)
  {
      int x;
      cin >> x;
      sum+=x;
  }
  if((n-sum)<0)
    cout << "-1\n";
 else
    cout << n-sum << '\n';
  return;
}

signed main()
{
  FAST
  int T=1;
  // cin >> T;
  while(T--)
  {
    solve();
  }
  return 0;
}

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

int main() {
  int K , A , B ;
  
  cin >> K ;
  cin >> A >> B ;
  

  
  for (int i = A ; i<=B ; i++){
   if(i % K ==0){
     cout << "OK" << endl ; 
     return 0 ;
   }

   
   

  }
      cout << "NG" << endl ; 
  
  
}


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


int main() {
    int N;
    cin >> N;
    if(N%2 == 0) cout << N/2 -1 << endl;
    else cout << N/2 << endl;
  }

Measured memory_bytes: 256
#include <stdio.h>
#define MAX 500000
#define INF 2000000000

int LEFT[MAX/2], RIGHT[MAX];
int count = 0;

void merge(int S[], int n, int left, int mid, int right){
  int i, j, k;
  int n1, n2;

  n1 = mid-left;
  n2 = right-mid;

  for(i = 0; i < n1; i++){
    LEFT[i] = S[left+i];
  }
  for(i = 0; i < n2; i++){
    RIGHT[i] = S[mid+i];
  }

  LEFT[n1] = INF;
  RIGHT[n2] = INF;

  i = 0;
  j = 0;

  for(k = left; k < right; k++){
    count++;
    if(LEFT[i] <= RIGHT[j]){
      S[k] = LEFT[i++];
    }
    else{
      S[k] = RIGHT[j++];
    }
  }
}

void mergesort(int S[], int n, int left, int right){
  int mid;

  if(left+1 < right){
    mid = (left+right)/2;
    //再帰させる
    mergesort(S,n, left, mid);
    mergesort(S, n, mid, right);

    merge(S, n, left, mid, right);
  }
}

int main(){
  int S[MAX];
  int n, i;
  scanf("%d",&n);
  for(i = 0; i < n; i++) scanf("%d",&S[i]);

  mergesort(S,n, 0, n);
  for(i = 0; i < n; i++){
    printf("%d",S[i]);
    if(i != n-1) printf(" ");
  }
  printf("\n%d\n",count);
  return 0;
}



Measured memory_bytes: 5652
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  string S;
  cin>>S;
  string tmp;
  bool can = false;
  for(int i=0;i<=S.size();++i) {
    for(int j=i;j<=S.size();++j) {
      tmp.clear();
      for(int k=0;k<S.size();++k) {
        if(i<=k && k<j) continue;
        tmp.push_back(S[k]);
      }
      if(tmp=="keyence") can = true;
    }
  }
  if(can) cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
}



Measured memory_bytes: 3624
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <climits>
#define all(x) (x).begin(),(x).end()

void solve(){

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

    if (a != 0){
        cout << (b/x + 1) - ((a - 1)/x + 1)  << endl;
    } else {
        cout << b/x + 1 << endl;
    }
}


Measured memory_bytes: 256
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

const int N = 250000;
vector<bool> p(N, true);
void Eratosthenes() {
	p[0] = false;
	p[1] = false;
	rep(i, N)
		if (p[i])
			for (int j = i * 2; j < N; j += i)
				p[j] = false;
}

int main() {
	Eratosthenes();

	while (true) {
		int x; cin >> x;
		if (x == 0)break;

		int cnt = 0;
		for (int i = x + 1; i <= 2 * x; i++) {
			if (p[i])cnt++;
		}
		cout <<  cnt << endl;
	}
}


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

using namespace std;
string s;
int n;
const int N = int(2e5 + 10);
int dp[N][2];
const int inf = int(1e8);

int solve(int i, int flag){
    if(i > n){
        return -inf;
    }
    if(i == n){
        return 0;
    }

    int &ans = dp[i][flag];

    if(dp[i][flag] != -1){
        return ans;
    }

    ans = -inf;
    string t;

    if(flag){    
        t = s[i - 2] + s[i - 1];
    }else{
        t = s[i - 1];
    }

    string e1 = "";
    e1.push_back(s[i]);

    if(e1 != t){
        ans = max(ans, 1 + solve(i + 1, 0));
    }

    if(i + 1 < n){
        e1.push_back(s[i + 1]);

        if(e1 != t){
            ans = max(ans, 1 + solve(i + 2, 1));
        }
    }

    return ans;
}
int main(){
    memset(dp, -1, sizeof dp);

    cin >> s;
    n = s.length();

    if(s.length() == 1 || (s.length() == 2 && s[0] == s[1])){
        printf("1\n");
    }else{
        printf("%d\n", max(solve(1, 0), solve(2, 1)) + 1);
    }

    return 0;
}

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

int main() {
  std::string s;
  std::cin >> s;
  
  int total = 700;
  if (s.at(0) == 'o') {
    total += 100;
  }
  if (s.at(1) == 'o') {
    total += 100;
  }
  if (s.at(2) == 'o') {
    total += 100;
  }
  
  std::cout << total << "\n";
  return 0;
}



Measured memory_bytes: 256
import java.util.*;

class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int a, b, c;
		
		a = sc.nextInt();
		b = sc.nextInt();
		c = sc.nextInt();
  	
		if(a < b && b < c)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
}

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

int mod = 1000000007;

int main()
{
    int A, B;
    cin >> A >> B;
    if (A == 1)
        A = 14;
    if (B == 1)
        B = 14;
    if (A > B)
        cout << "Alice";
    if (A < B)
        cout << "Bob";
    if (A == B)
        cout << "Draw";
}

Measured memory_bytes: 256
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
    int a[5];
    rep(i,5) cin >> a[i];
    rep(i,5) if(a[i]==0) cout << i+1 << ' ' ;
    cout << endl;
}


Measured memory_bytes: 3632
import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(sc.hasNext()){
			int n = sc.nextInt();
			if(n==-1)break;
			if(n==0){
				System.out.println("0");
			}else{
				int i=-1;
				int j=1;
				while(n>=j){
					j*=4;
					i++;
				}
				j/=4;
	
				int[] ans = new int[i+1];
				for(int k=i;k>=0;k--){
					ans[k] = n/j;
					n %= j;
					j /= 4;
				}
				for(int k=i;k>=0;k--){
					System.out.print(ans[k]);
				}
				System.out.println();
			}
			
		}
		
	}	
}

Measured memory_bytes: 23440
#include<iostream>
#include<cctype>
#include<cassert>
using namespace std;

string s;
int cur;

int factor();

char readchar(){
  assert(cur <s.size());
  char ret =s[cur];
  cur += 1;
  return ret;
}

char peak(){
  assert(cur<s.size());
  return s[cur];
}

int digit(){
  assert(isdigit(peak()));
  int n = readchar() - '0';
  return n;
}

int number(){
  int n= digit();
  while(cur<s.size()&&isdigit(peak()))
    n=n*10+digit();
  return n;
}

int term(){
  int a = factor();
  while((cur <s.size()) && (peak()=='*' || peak() == '/')){
    char op = readchar();
    int b = factor();
    if(op=='*') a*=b; else a/=b;
  }

  return a;
}
    
int expression(){
  int a=term();
  while((cur<s.size())&& (peak()=='+' || peak() == '-')){
    char op = readchar();
    int b= term();
    if(op == '+') a+=b;else a-=b;
  }
  return a;
}

int factor(){
  if(peak() != '(') return number();
  cur += 1;
  int n = expression();
  assert(peak() == ')');
  cur+=1;
  return n;
}


int main(){
  int n;
  cin>>n;
  for(int i=0;i<n;i++){
    cur=0;
    cin>>s;
    s.resize(s.size()-1);
    cout<<expression() <<endl;
  }
}

Measured memory_bytes: 3140
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=(n);(i)++)
#define fd0g(i,n) for ((i)=(n);(i)>=0;(i)--)
#define fz0k(i,n) for ((i)=0;(i)<(n);(i)++)
#define fd0k(i,n) for ((i)=(long long)((n)-1);(i)>=0;(i)--)
#define fz(i,x,y) for ((i)=(x);(i)<=(y);(i)++)
#define fd(i,y,x) for ((i)=(y);(i)>=(x);(i)--)
#define fzin fz1(i,n)
#define fzim fz1(i,m)
#define fzjn fz1(j,n)
#define fzjm fz1(j,m)
#define ff(c,itr) for (__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define rdst(st,len){static char ss[len];scanf(" %s",ss);(st)=ss;}
#define inc(x,y) {x+=(y);if(x>=mod)x-=mod;}
#define dec(x,y) {x-=(y);if(x<0)x+=mod;}
using namespace std;
int n,m,i,j,a,b;
int main()
{
	cin>>a>>b;
	if(a<=0&&0<=b){
		puts("Zero");
		return 0;
	}
	if((max(0,-(a-1))-max(0,-b))&1){
		puts("Negative");
		return 0;
	}
	puts("Positive");
	return 0;
}

Measured memory_bytes: 256
#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define ll long long
int main(){
    int N;
    cin >> N;
    cout << N*800-N/15*200;
    return 0;
}


Measured memory_bytes: 256
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <climits>
#include <cstring>
#include <unordered_map>

using namespace std;

#define int long long
#define rep(i, n) for (int i=0;i<(int)(n);++i)
#define rep1(i, n) for (int i=1;i<=(int)(n);++i)
#define range(i, l, r) for (int i=l;i<(int)(r);++i)
#define rrange(i, l, r) for (int i=r-1;i>=(int)(l);--i)
#define unless(a) if(!(a))
#define all(a) begin(a),end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back

using vi=vector<int>;
using pii=pair<int, int>;
using ll=long long;

bool chmin(int&a,int b){return a>b?(a=b,true):false;}
bool chmax(int&a,int b){return a<b?(a=b,true):false;}
//int read(){int a;scanf("%lld",&a);return a;}

constexpr int TEN(int n){return n==0?1:10*TEN(n-1);}

const int inf = TEN(18)*3 + 10;
const int mod = TEN(9) + 7;

int N, K;
int rui[100010], rui_b[100010];

signed main()
{
	int a,b,c;cin >> a >> b >> c;
	int m = max(a, max(b, c));

	for(;;m++){
		int s=3*m-(a+b+c);
		if (s % 2 == 0) {
			cout << s / 2 << endl;
			return 0;
		}
	}
}



Measured memory_bytes: 256
#include <bits/stdc++.h>
using namespace std;
int main(){
	long long ans = 0, pass = 1, n;
	cin >> n;
	while(n--){
		long long x; cin >> x;
		if(x > pass){
			if(x % pass){
				ans += x / pass;
				x = 1;
			} else {
				ans += x / pass - 1;
				x = 1;
			}
		}
		pass = max(pass, x + 1);
	}
	cout << ans << endl;
	return 0;
}


Measured memory_bytes: 384
import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int sx = sc.nextInt();
		int sy = sc.nextInt();
		int tx = sc.nextInt();
		int ty = sc.nextInt();
		StringBuilder ans = new StringBuilder();
		for(int i=0; i<tx-sx; i++) {
			ans.append('R');
		}
		for(int i=0; i<ty-sy; i++) {
			ans.append("U");
		}
		for(int i=0; i<tx-sx; i++) {
			ans.append('L');
		}
		for(int i=0; i<ty-sy; i++) {
			ans.append('D');
		}
		ans.append('L');
		for(int i=0; i<ty-sy+1; i++) {
			ans.append('U');
		}
		for(int i=0; i<tx-sx+1; i++) {
			ans.append('R');
		}
		ans.append('D');
		ans.append('R');
		for(int i=0; i<ty-sy+1; i++) {
			ans.append('D');
		}
		for(int i=0; i<tx-sx+1; i++) {
			ans.append('L');
		}
		ans.append('U');
		print(ans.toString());
	}
	
	// print
	static void print(String s) {
		System.out.println(s);
	}
	
	// union find lib
	// usage:
	// 最初にinitを呼ぶ
	// root: 直接は呼ばないで
	// unite: まとめる
	// same: グループ判定
	static void init(int par[], int N) {
		for(int i=0; i<N; i++) {
			par[i] = i;
		}
	}
	
	static int root(int x, int [] par) {
		if(par[x] == x) {
			return x;
		} else {
			return (par[x] = root(par[x], par));
		}
	}
	
	static boolean same(int x, int y, int[] par) {
		return root(x, par) == root(y, par);
	}
	
	static void unite(int x, int y, int[] par) {
		x = root(x, par);
		y = root(y, par);
		if(x == y) return;
		par[x] = y;
	}
	
	// end union find lib
	
	// number lib
	
	static long lcm(long a, long b) {
		return a*(b/gcd(a, b));
	}
	
	static long gcd(long a, long b) {
		long ta = Math.max(a, b);
		long tb = Math.min(a, b);
		long tmp;
		while((tmp = ta%tb) != 0) {
			ta = tb;
			tb = tmp;
		}
		return tb;
	}
	
	static long modcomb(long n, long k, long mod) {
		if(k==1) {
			return n;
		}
		
		long ans = 1;
		for(long i=n; i>=n-k+1; i--) {
			ans = (ans * i)%mod;
		}
		for(long i=k; 0<i; i--) {
			ans = (ans * modpow(i, mod-2, mod)) % mod;
		}
		return ans;
	}
	
	static long modpow(long a, long b, long mod) {
		if(b==0) return 1;
		if(b%2==0) {
			long d = modpow(a, b/2, mod);
			return (d*d)%mod;
		} else {
			return (a*modpow(a, b-1, mod))%mod;
		}
	}
	
	static int disit(long a, long d) {
		int count = 0;
		while(a!=0) {
			a = a/d;
			count++;
		}
		return count;
	}
	
	// end number lib
}

Measured memory_bytes: 22740