Codeforces Round #680 (Div. 2, based on Moscow Team Olympiad)A~D

A

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 1e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
const int mod = 998244353;
ll fast_pow(ll a,ll b){
	ll ans = 1;
	while(b){
		if(b&1)ans = (ans * a)%mod;
		a = (a * a)%mod;
		b>>=1;
	}
	return (ans%mod);
}
typedef pair<int,int> pii;
int a[N],b[N];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
#if DBG
	freopen("input.txt","r",stdin);
#endif
	int t;
	cin>>t;
	while(t--){
		int n,x;
		cin>>n>>x;
		for(int i = 0;i < n;i++)cin>>a[i];
		for(int i = 0;i < n;i++)cin>>b[i];
		sort(a,a+ n);
		sort(b,b+n,greater<int>());
		bool f = true;
		for(int i = 0; i< n;i++)
			if(a[i] + b[i] > x)f = false;
		printf("%s\n",f?"Yes":"No");
	}
	return 0;
}

B

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 1e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
const int mod = 998244353;
ll fast_pow(ll a,ll b){
	ll ans = 1;
	while(b){
		if(b&1)ans = (ans * a)%mod;
		a = (a * a)%mod;
		b>>=1;
	}
	return (ans%mod);
}
typedef pair<int,int> pii;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
#if DBG
	freopen("input.txt","r",stdin);
#endif
	int t;
	cin>>t;
	while(t--){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		cout<<max(a+b,c+d)<<endl;
	}
	return 0;
}

C

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 1e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
const int mod = 998244353;
ll fast_pow(ll a,ll b){
	ll ans = 1;
	while(b){
		if(b&1)ans = (ans * a);
		a = (a * a);
		b>>=1;
	}
	return ans;
}
typedef pair<int,int> pii;
int prime[N];
vector<int> pri;
void get(){
	for(int i = 2;i <= 100000;i++){
		if(!prime[i]){
			pri.pb(i);
			for(int j = i;j <= 100000;j += i)prime[j]  = 1;
		}
	}
}
//int cnt1[N],cnt2[N];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
#if DBG
	freopen("input.txt","r",stdin);
#endif
	get();
	int t;
	cin>>t;
	while(t--){
		ll p,q;
		cin>>p>>q;
		if(p % q == 0){
			ll min_div= 1e18;
			ll pp = p;
			for(int i = 0;i < pri.size();i++){
				if(q % pri[i] == 0){
					ll cnt1= 0,cnt2= 0;
					while(p % pri[i] == 0){
						p/= pri[i];
						cnt1++;
					}
					while(q % pri[i] ==0){
						q/= pri[i];
						cnt2++;
					}
					min_div = min(min_div,fast_pow(pri[i],cnt1 - cnt2 + 1));
				}
			}
			if(q != 1){
				ll cnt = 0;
				while(p % q == 0)cnt++,p/=q;
				min_div = min(min_div,fast_pow(q,cnt));
			}
			cout<<pp/min_div<<endl;
		}else
			cout<<p<<endl;
	}
	return 0;
}

D.考虑将2n个元素中较小的一半归为集合L，较大的一半归为集合R。
考虑某种划分(p,q)，对于任意位置i, p_i,q_i 不可能都属于L。
假定都属于 L, 则 p_1_{p_i属于L，q_i}q_n 属于L，则L有n+1个元素，矛盾。
同理p_i,q_i 不可能都属于R，则p_i,q_i一个属于L，一个属于R。
任意划分(p,q)对答案的贡献都是sum®-sum(L)

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 3e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
const int mod = 998244353;
ll fast_pow(ll a,ll b){
	ll ans = 1;
	while(b){
		if(b&1)ans = (ans * a)%mod;
		a = (a * a)%mod;
		b>>=1;
	}
	return (ans%mod);
}
typedef pair<int,int> pii;
ll a[N],b[N];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
#if DBG
	freopen("input.txt","r",stdin);
#endif
	int n;
	cin>>n;
	for(int i = 1;i <= n;i++)
		cin>>a[i];
	for(int i = 1;i <= n;i++)
		cin>>b[i];
	sort(a + 1,a + 1 + n);
	sort(b + 1,b + 1 + n,greater<int>());
	ll ans = 0;
	for(int i = 1;i <= n;i++)
		ans += abs(a[i] - b[i]),ans %= mod;
	for(int i = 2 * n;i > n;i--)
		ans = (ans * i)%mod;
	for(int i = n;i >= 1;i--)
		ans = (ans * fast_pow(i,mod - 2))%mod;
	cout<<ans<<endl;
	return 0;
}

E
----------------待补-------------------