AtCoder Beginner Contest 181 A ~ E

#include<bits/stdc++.h>
 
using namespace std;
 
int main(){
	int n;
	cin>>n;
	if(n % 2 == 0) cout<<"White"<<endl;
	else cout<<"Black"<<endl;
	return 0;
}

#include<bits/stdc++.h>
#define maxn 1000005
using namespace std;
typedef long long ll;
ll f[maxn];
void init(){
	 f[0] = 0;
     for(int i=1;i<=1000000;i++){
     	f[i] = f[i-1] + i;
	 }
}
 
int main(){
	init();
	ll n;
    scanf("%lld",&n);
	ll sum = 0;
	ll l,r;
	for(ll i=1;i<=n;i++){
		scanf("%lld %lld",&l,&r);
		sum += (f[r] - f[l-1]);
		//cout<<f[r]<<" "<<f[l-1]<<endl;
		//cout<<sum<<endl;
	}
	cout<<sum<<endl;
	return 0;
}

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

typedef  long long ll;



const int maxn=1e5+50;
struct node
{
    int  x,y;
}e[maxn];
 
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;++i)
    {
        cin>>e[i].x>>e[i].y;
    }
    int flag=0;
    for(int i=0;i<n;++i)
    {
        for(int j=i+1;j<n;++j)
        {
            for(int k=j+1;k<n;++k)
            {
                if(e[i].x==e[j].x&&e[i].y==e[j].y&&e[i].x==e[k].x&&e[i].y==e[k].y)
                {
                    flag=1;
                    break;
                }else if((e[i].x-e[j].x)*(e[k].y-e[j].y)==(e[i].y-e[j].y)*(e[k].x-e[j].x))
                {
                    flag=1;
                    break;
                }
            }
        }
    }
    if(flag) cout<<"Yes\n";
    else cout<<"No\n";
    return 0;
}

#include<bits/stdc++.h>
#include<iostream>
using namespace std;



int main(){
	string s;
	cin>>s;
	int n=s.length();
	
	vector<int> d(10,0);
	
	for(auto it:s)
		d[it-'0']++;
	if(n==1){
		if(d[8]){
			cout<<"Yes";
			return 0;
		}
	}
	else if(n==2){
		for(int i=16;i<100;i+=8){
			map<int,int> m;
			m[i%10]++;
			m[(i/10)%10]++;	

			bool yes=true;
			for(auto it:m){
				if(d[it.first]<it.second){
					yes=false;
					break;
				}
			}
			if(yes){
				cout<<"Yes"<<endl;
				return 0;
			}
		}	
	}
	else{
		for(int i=104;i<1000;i+=8){
			map<int,int> m;
			m[i%10]++;
			m[(i/10)%10]++;	
			m[(i/100)%10]++;

			bool yes=true;
			for(auto it:m){
				if(d[it.first]<it.second){
					yes=false;
					break;
				}
			}
			if(yes){
				cout<<"Yes"<<endl;
				return 0;
			}
		}
	}
	cout<<"No"<<endl;
	return 0; 
}

#include<bits/stdc++.h>
#define N 200005
using namespace std;
typedef long long ll;
 
int n,m;
int h[N],w[N];
ll L[N],R[N];
ll ans=1e18;
 
int main() {
 
    cin>>n>>m;
    for(int i=1;i<=n;++i) cin>>h[i];
    for(int i=1;i<=m;++i) cin>>w[i];
 
    sort(h+1,h+1+n);
 
    for(int i=2;i<=n;i+=2) L[i]=L[i-2]+abs(h[i]-h[i-1]);
    for(int i=n-1;i>=1;i-=2) R[i]=R[i+2]+abs(h[i]-h[i+1]);
 
    for(int i=1;i<=m;++i){
        int pos=lower_bound(h+1,h+1+n,w[i])-h;
        if(pos%2==0) pos--;
        ans=min(ans,L[pos-1]+R[pos+1]+abs(h[pos]-w[i]));
    }
    cout<<ans<<endl;
    return 0;
}