Educational Codeforces Round 121 (Rated for Div. 2)题解
A. Equidistant Letters题意:给你一个字符串s,其中每个字符最多出现两次,将s重新排列,使得其中任意两个相同的字符的距离相同,输出任意一个答案思路:将字符串s排序即可#include<bits/stdc++.h>using namespace std;void solve(){ string s; cin>>s; sort(s.begin(),s.end()); cout<<s<