Codeforces Round 944 (Div. 4) A - G

div.4只写部分题解了，都比较基础，数学偏多一点，几乎没有算法，有不懂的欢迎评论区提问！

A. My First Sorting Problem

#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int maxn = 2e6 + 7 ;
const int mod = 998244353 ;
inline ll read() {
	ll x = 0, f = 1 ;
	char c = getchar() ;
	while (c > '9' || c < '0') {
		if (c == '-')
			f = -1 ;
		c = getchar() ;
	}
	while (c >= '0' && c <= '9') {
		x = x * 10 + c - '0' ;
		c = getchar() ;
	}
	return x * f ;
}

ll a[maxn] , n , m , t ;

void solve(){
	n = read() ;
	m = read() ;
	cout << min(n , m) << " " << max(n , m) << endl ;
}
int main(){
	t = read() ;
	while(t --){
		solve() ;
	}
	return 0 ;
}

B. Different String

#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int maxn = 2e6 + 7 ;
const int mod = 998244353 ;
inline ll read() {
	ll x = 0, f = 1 ;
	char c = getchar() ;
	while (c > '9' || c < '0') {
		if (c == '-')
			f = -1 ;
		c = getchar() ;
	}
	while (c >= '0' && c <= '9') {
		x = x * 10 + c - '0' ;
		c = getchar() ;
	}
	return x * f ;
}

ll a[maxn] , n , m , t ;
char s[maxn] ;
void solve(){
	scanf("%s" , s + 1) ;
	ll len = strlen(s + 1) ;
	map < int , int > mp ;
	for(int i = 1 ; i <= len ; i ++){
		mp[s[i] - 'a' + 1] ++ ;
	}
	for(auto it : mp){
		if(it.second == len){
			cout << "NO\n" ;
			return ;
		}
	}
	cout << "YES\n" ;
	for(int i = 2 ; i <= len ; i ++){
		cout << s[i] ;
	}
	cout << s[1] &l