akhauriyash/Code-Regression huggingface dataset:
#include <stdio.h>
#include <iostream>
using namespace std;

int main(void){
  int W, H, x, y, r;
  cin >> W >> H >> x >> y >> r;
  if(x>=r && x<=W-r && y>=r && y<=H-r){
    printf("Yes\n");
  }else{
    printf("No\n");
  }
  return 0;
}



Measured memory_bytes: 3080
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
#include <algorithm>

using namespace std;

using ll = long long;
using ld = long double;
using lli = long long int;

#define PI 3.14159265358979323846264338327950L

int main(){
  int N, K, temp, result=0;
  vector<int> price;
  cin >> N >> K;

  for(int i = 0; i < N; i++){
    cin >> temp;
    price.push_back(temp);
  }

  sort(price.begin(), price.end());
  for (int i = 0; i < K; i++){
    result += price.at(i);
  }

  cout << result << endl;  
  
  return 0;
}


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

using ll = long long;

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)

#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second

#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))

using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using ld = long double;

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "{";
    rep(i, (int)v.size()) {
        if (i)
            os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <typename T, size_t S> void printArray(const T (&array)[S]) {
    for (auto val : array)
        std::cout << val << ", ";
    std::cout << "\n";
}

const int mod = 1e9 + 7;
const int inf = 1e9 + 5;

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

    int n; std::cin >> n;
    int ans = 0;
    rep(i, n) {
        int x; std::cin >> x;
        if (i & 1) continue;
        ans += x & 1;
    }
    std::cout << ans << "\n";
}


Measured memory_bytes: 3644
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))

import numpy as np

Q = np.cumsum(P)

R = np.pad(Q,K,'constant', constant_values=0)[:N]

a = np.argmax(Q-R)

ans = 0
for i in range(K):
    ans += (1.00+P[a-i])/2.00
print(ans)

Measured memory_bytes: 42244
a, b, c, d = map(int, input().split())
s = b//c-(a-1)//c
t = b//d-(a-1)//d

#import fractions
import math
from functools import reduce
def lcm_base(x, y):
  #return (x * y) // fractions.gcd(x, y)
  return (x * y) // math.gcd(x, y)

l = lcm_base(c, d)

r = b//l-(a-1)//l

#print(s, t, r)

ans = b-a+1-(s+t-r)
print(ans)


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

using namespace std;

int main() {
		string S;
		cin >> S;
		int w = 0;
		for (int i = 0; i < S.size(); i++) {
				if (S[i] == 'o') w++;
		}

		int r = 15 - S.size();
		if ((w+r) >= 8) cout << "YES" << endl;
		else cout << "NO" << endl;
		return 0;
}


Measured memory_bytes: 384
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<stack>
#include<set>
#include<string.h>
#include<map>
#include<queue>
#include<vector>
#define pb push_back
#define eb emplace_back
#define ins insert 
#define mp make_pair
#define ll long long 
#define max3(a,b,c) max(c,max(a,b))
#define min3(a,b,c) min(c,min(a,b))
#define inf 1000000000000000000
#define M 1000000007
using namespace std;
void solve(){
	ll n,k;
	cin>>n;
	ll a[n];
	for (int i = 0; i <n; ++i)
	{
		cin>>a[i];
	}
	ll dp[n+5][n+5];
	for (int i =n-1; i>=0; --i)
	{
		for (int j = i; j<n; ++j)
		{
			if(j==i)
				dp[i][j]=a[j];
			else
				dp[i][j]=max(a[i]-dp[i+1][j],a[j]-dp[i][j-1]);
		//	cout<<dp[i][j]<< " ";
		}
		//cout<<endl;
	}
	cout<<dp[0][n-1];
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0 ;
}


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

int main() {
  ll n;
  cin >> n;
  vector<ll> a(n), b(n);
  ll ans = 0;
  rep(i,n){
    cin >> a[i] >> b[i];
  }
  for (ll i = n-1; i >= 0; i--){
    if(a[i] % b[i] == 0){
      if(i > 0) a[i-1] += ans;
      continue;
    }
    ll rest = a[i] % b[i];
    ans += b[i] - rest;
    if(i > 0) a[i-1] += ans;
  }
  cout << ans << endl;
}

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

int main() {
  int n,m,x;
  cin >> n >> m >> x;
  vector<int> a(m);
  for (int i=0;i<m;i++) {
	cin >> a.at(i);
  }
  sort(a.begin(), a.end());
  int lc=0;
  int rc=0;
  for (int i=0;a.at(i)<x;i++) lc++;
  rc=m-lc;
		  cout << min(rc,lc);

}

Measured memory_bytes: 256
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main()
{
  ll N, T;
  cin >> N >> T;
  vector<ll> t(N);
  rep(i, N)
  {
    cin >> t[i];
  }
  ll ans = 0;
  rep(i, N)
  {
    if (i == N - 1)
    {
      ans += T;
    }
    else
    {
      ans += min(T, t[i + 1] - t[i]);
    }
  }
  cout << ans << endl;
  return 0;
}

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

typedef long long ll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()

template<class T, class TL, class TR>
bool inside(T x, TL l, TR r) {
  return x >= l && x <= r;
}

template<class T, class U> 
bool uin(T& x, U y) {
  if (y < x) {
    x = y;
    return true;
  }
  return false;
}

template<class T, class U>
bool uax(T& x, U y) {
  if (y > x) {
    x = y;
    return true;
  }
  return false;
}

void unsync_io() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}

const int N = (int) (5e3 + 7);
const int mod = (int) (1e9 + 7);

int bin(int x, int y) {
  int res = 1;
  while (y != 0) {
    if (y & 1)
      res = (ll) res * x % mod;
    x = (ll) x * x % mod;
    y >>= 1;
  }
  return res;
}

vector<int> g[N];
int col[N];
bool used[N];
int dp[N][N];

void dfs(int u, int color) {
  col[u] = color;
  used[u] = true;
  for (int v : g[u])
    if (!used[v])
      dfs(v, color);
}

void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  int bad = 0;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    if (p[i] != -1) {
      p[i]--;
      g[i].push_back(p[i]);
      g[p[i]].push_back(i);
    } else
      bad++;
  }
  int cnt = 0;
  for (int i = 0; i < n; i++)
    if (!used[i])
      dfs(i, cnt++);
  vector<int> sz(cnt, 0);
  vector<bool> good(cnt, false);
  for (int i = 0; i < n; i++) {
    sz[col[i]]++;
    if (p[i] == -1)
      good[col[i]] = true;
  }
  int total = bin(n - 1, bad);
  int ans = (ll) n * total % mod;
  vector<int> good_sz;
  for (int i = 0; i < cnt; i++) {
    if (good[i])
      good_sz.push_back(sz[i]);
    else {
      ans -= total;
      if (ans < 0)
        ans += mod;
    }
  }
  int k = good_sz.size();
  dp[0][0] = 1;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i + 1][j] += dp[i][j];
      if (dp[i + 1][j] >= mod)
        dp[i + 1][j] -= mod;
      if (j != k) {
        dp[i + 1][j + 1] += (ll) dp[i][j] * good_sz[i] % mod;
        if (dp[i + 1][j + 1] >= mod)
          dp[i + 1][j + 1] -= mod;
      }
    }
  }
  for (int i = 0; i < k; i++) {
    ans -= (ll) (good_sz[i] - 1) * bin(n - 1, bad - 1) % mod;
    if (ans < 0)
      ans += mod;
  }
  int cur = 1;
  for (int len = 2; len <= k; len++) {
    cur = (ll) cur * (len - 1) % mod;
    int delta = (ll) dp[k][len] * bin(n - 1, bad - len) % mod * cur % mod;
    ans -= delta;
    if (ans < 0)
      ans += mod;
  }
  cout << ans << '\n';
}

void run() {
  solve();
}

int main() {
  unsync_io();
  auto start = chrono::high_resolution_clock::now();
  run();
  auto end = chrono::high_resolution_clock::now();
  cerr << "Execution time: " << chrono::duration_cast<chrono::milliseconds>(end - start).count() << '\n';
  return 0;
}


Measured memory_bytes: 101536
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N, L, nums[100009];
    
    cin>>N>>L;
    rep(i,N) cin>>nums[i];
    
    ll mx=0, best;
    rep(i,N-1){
        if(mx<nums[i]+nums[i+1]){
            mx=nums[i]+nums[i+1];
            best=i;
        }
    }
    
    if(mx<L){
        cout1("Impossible");
    }else{
        cout1("Possible");
        rep(i,best){
            cout1(i+1);
        }
        for(int i=N-1;i>best;i--){
            cout1(i);
        }
    }
}

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

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

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

template<typename T>
void print1(T begin, T end) {
	while (begin != end) {
		cerr << (*begin) << " ";
		*begin++;
	}
	cerr << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
	for (int i = 0; i < height; i++) {
		for (int j = 0; j < width; j++) {
			cerr << " " << Array[i][j];
		}
		cerr << endl;
	}
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
	std::cerr << head << " ";
	print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
	int val = ((a % mod) + (b % mod)) % mod;
	if (val < 0) { val += mod; }
	a = val;
}

template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

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

const int mod = 1e9+7;

int dp[111111][2];

signed main() {
	string L;
	cin >> L;
	int n = L.size();

	dp[0][0] = 0;
	dp[0][1] = 1;
	for (int i = 0; i < L.size(); i++) {
		if (L[i] == '1') {
			dp[i+1][1] = dp[i][1]*2;
			dp[i+1][1] %= mod;
			dp[i+1][0] = dp[i][1] + dp[i][0]*3;
			dp[i+1][0] %= mod;
		} else {
			dp[i+1][1] = dp[i][1];
			dp[i+1][0] = dp[i][0]*3;
			dp[i+1][1] %= mod;
			dp[i+1][0] %= mod;
		}
	}

	int ans = dp[n][0] + dp[n][1];
	ans %= mod;

	cout << ans << endl;

	return 0;
}

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

int main(){

    int n,x;
    cin >> n >> x;
    int a[n];
    for(int i=0; i<n; i++){
        cin >> a[i];
    }

    sort(a,a+n);
    long long int total = 0;
    for(int i=0; i<n; i++){
        total += a[i];
        if(total > x){
            cout << i << endl;
            return 0;
        }
    }

    if(total == x){
        cout << n << endl;
    }else{
        cout << n-1 << endl;
    }
    return 0;
}

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

int n,m;

int main(void)
{

	cin >> n >> m;
	vector<int> vec(n);
	set<int> out;	// 既に表示した

	for(int i = 0; i < n; i++){
		cin >> vec[i];
	}

	reverse(vec.begin(), vec.end() );

	int c = 0;
	for(int i = 0; i < n; i++){
		if(out.size() == m)
			break;
		if(out.empty() || !out.count(vec[i])){
			cout << vec[i] << endl;
			out.insert(vec[i] );
		}
	}


	

	return 0;
}

Measured memory_bytes: 3908
import sys

input = sys.stdin.readline


def main():
    N = int(input())
    p = list(map(int, input().split()))

    ans = 0
    for i in range(N - 1):
        if p[i] == i + 1:
            ans += 1
            p[i], p[i + 1] = p[i + 1], p[i]
    if p[-1] == N:
        ans += 1

    print(ans)


if __name__ == "__main__":
    main()


Measured memory_bytes: 13876
#include <bits/stdc++.h>
using namespace std;
const int N=305,mod=1e9+7;
int n,m,f[N][N][N];
bool vis[N][N][N];
vector<pair<int,int> >lim[N];
bool Judge(int i,int j,int k){
	int len=max(i,max(j,k));
	for(int p=0;p<lim[len].size();p++){
		int cnt=(i>=lim[len][p].first)+(j>=lim[len][p].first)+(k>=lim[len][p].first);
		if(cnt!=lim[len][p].second)return 0;
	}
	return 1;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		int l,r,x;
		scanf("%d%d%d",&l,&r,&x);
		lim[r].push_back(make_pair(l,x));
	}
	int ans=0;
	f[0][0][0]=1;
	for(int i=0;i<=n;i++)
		for(int j=0;j<=n;j++)
			for(int k=0;k<=n;k++){
				if(vis[i][j][k]||!Judge(i,j,k))continue;
				vis[i][j][k]=1;
				if(i==n||j==n||k==n)ans=(ans+f[i][j][k])%mod;
				int len=max(i,max(j,k));
				f[len+1][j][k]=(f[len+1][j][k]+f[i][j][k])%mod;
				f[i][len+1][k]=(f[i][len+1][k]+f[i][j][k])%mod;
				f[i][j][len+1]=(f[i][j][len+1]+f[i][j][k])%mod;
			}
	cout<<ans<<"\n";
}

Measured memory_bytes: 137728
#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int a[N];
int b[N];
int c[N];
int dp[N][4];
int n;
int calc(int idx, int prev) {
	if (idx >= n)
		return 0;
	int &ret = dp[idx][prev];
	if (ret != -1)
		return ret;
	for (int i = 0; i < 3; ++i)
		if (i != prev)
			ret = max(ret, calc(idx + 1, i) + (i == 0 ? a[idx] : (i == 1 ? b[idx] : c[idx])));
	return ret;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; ++i)
		cin >> a[i] >> b[i] >> c[i];
	memset(dp, -1, sizeof(dp));
	cout << calc(0, 3) << endl;
	return 0;
}

Measured memory_bytes: 9216
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
//mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int main() {
	int n;
	rep(i,1,5+1){
		scanf("%d",&n);
		if(n==0){
			printf("%d",i);
			return 0;
		}
	}
} 

Measured memory_bytes: 3764
import java.util.Scanner;
public class Main {
    public static void main(String[] args){
        Scanner scan=new Scanner(System.in);
        while(true){
            String str=scan.next();
            if(str.equals("-")) break;
            int m=scan.nextInt();
            int[] h=new int[m];
            for(int i=0;i<m;i++){
                h[i]=scan.nextInt();
                str=str.substring(h[i],str.length())+str.substring(0,h[i]);
            }
            System.out.println(str);
        }
    }
}


Measured memory_bytes: 26536
#include <stdio.h>

int gcd(long long int a, long long int b);
int max(long long int a, long long int b);

int main()
{
	int a, b;
	while (scanf("%d %d", &a, &b) != EOF) printf("%d %d\n", gcd(a, b), a * (b / gcd(a, b)));
	return 0;
}

int gcd(long long int a, long long int b)
{
	while(a * b) {
		if(a < b) b %= a;
		else a %= b;
	}
	return max(a, b);
}

int max(long long int a, long long int b)
{
	if(a >= b) return a;
	else return b;
}

Measured memory_bytes: 0
#include <iostream>
#include <cstring>
#include <sstream>
#include <algorithm>
#define OPEN 0
using namespace std;
int main() {
	int N;
#if OPEN
	freopen("input.txt", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	while (cin >> N) {
		string s;
		int ca, cb, c2,countab;
		ca = cb = c2 = countab = 0;
		int cra = 0; int crb = 0;
		for (int j = 0; j < N; j++) {
			cin >> s;
			int cat, cbt, c2t;
			cat = cbt = c2t = 0;
			int cra_f = 0; int crb_f = 0;
			for (int i = 0; i < s.size(); i++) {	
				if (i == 0) {
					if (s[i] == 'B') { cb++; cbt++; crb_f = 1; }
					else cra_f = 1;
				}
				else if (i == s.size() - 1) {
					if (s[i] == 'A') { ca++; cat++; 
					if (cra_f)cra++;
					}
					else {
						if (crb_f)crb++;
					}
					c2t = cat + cbt;
					if (c2t == 2)c2++;
				}
				if (i != s.size() - 1) {
					if (s[i] == 'A' &&s[i + 1] == 'B')countab++;
				}

			}

		}
		if (c2) {
			int coup = 0;
			if (cra == 0 && crb == 0)coup = 0;
			else if (cra == 0 || crb == 0)coup = 1;
			else if (cra > 1 && crb > 1)coup = min(cra - 1, crb - 1) + 2;
			else coup = 2;
			cout << c2 - 1 + countab + coup << '\n';
		}
		else cout << countab + min(cra, crb) << '\n';
	}
	return 0;
}

Measured memory_bytes: 256
#include<iostream>
#include<string>
using namespace std;
int main() {
	string a[10], b;
	int c, d;
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
		if (a[i] == "-") {
			for (int k = 0; k < i; k++) {
				cout << a[k] << endl;
			}
			return 0;
		}
		cin >> c;
		for (int j = 0; j < c; j++) {
			cin >> d;
			b = a[i].substr(0,d);
			a[i].erase(0, d);
			a[i] = a[i] + b;
		}
	}
}


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

int main() {
    int n, a, b, c, d;
    bool ok = true;
    string s;
    cin >> n >> a >> b >> c >> d >> s;
    a--;
    b--;
    c--;
    d--;
    for(int i=a+1;i<=c;i++){
        if(s[i] == '#' && s[i+1] == '#'){
            ok = false;
            break;
        }
    }
    for(int i=b+1;i<=d;i++){
        if(s[i] == '#' && s[i+1] == '#'){
            ok = false;
            break;
        }
    }
    if(ok && d<c){
        ok = false;
        for(int i=b;i<=d;i++){
            if(s[i-1] == '.' && s[i] == '.' && s[i+1] == '.'){
                ok = true;
                break;
            }
        }
    }
    
    if(ok){
        cout << "Yes" <<endl;
    }else{
        cout << "No" << endl;
    }
	return 0;
}

Measured memory_bytes: 640
#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
const double PI = acos(-1.0);
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define SUM(c) accumulate((c).begin(),(c).end(),0)
#define UNIQ(c) (c).erase(unique((c).begin(), (c).end()), (c).end());
#define Yn(b) puts(b?"Yes":"No")
#define YN(b) puts(b?"YES":"NO")
 
bool isprime(int p) {
  if (p==1) return false;
  FOR(i,2,p) {
    if (p%i==0) return false;
  }
  return true;
}

int main(){
  int a,b;
  cin >> a >> b;
  if (b==100){
    cout << b+1;
  } else {
    cout << b;
  }
  REP(i,a){
    cout << "00";
  }
  return 0;
}


Measured memory_bytes: 256
class Solution:
#    def solve(self, N: int, P: List[int]) -> int:
    def solve(self, N, P) :
        max_p = N
        answer = 0

        for pn in P:
            if pn <= max_p:
                answer += 1
                max_p = pn

        return answer


if __name__ == '__main__':

    # standard input
    N = int(input())

    P = list(map(int, input().split()))

    # solve
    solution = Solution()
    print(solution.solve(N, P))


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

using namespace std;

#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L

typedef long long ll;

void solve(){
	int a, b, h, m;
	cin >> a >> b >> h >> m;
	
	long double rad = PI * 2 * (
		(long double)h / 12.0 + ((long double)m / 60.0) / 12.0 - 
			(long double)m / 60.0);
			
	long double rsq = (long double)(a * a + b * b) - (long double)
		(2 * a * b) * cosl(rad);
		
	printf("%20.20Lf\n", sqrtl(rsq));
}

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

	solve();
    
    return 0;
}


Measured memory_bytes: 3980