Codeforces Round #666 (Div. 2)

Codeforces Round #666 (Div. 2)

A. Juggling Letters

#include <bits/stdc++.h>
#define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
using namespace std;

void solve() {
    int n,a[50]={0},flag=0;
    cin>>n;
    for (int i = 0; i < n; ++i) {
        string s;
        cin>>s;
        for(char x:s)a[x-'a']++;
    }
    for(int x:a)if (x%n)flag=1;
    cout<<(flag?"NO":"YES")<<endl;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    cin>>_;
    while (_--) {
        solve();
    }
    return 0;
}

B. Power Sequence

#include <bits/stdc++.h>
#define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
using namespace std;

int a[maxn];

void solve() {
    int n,ans=1e18;
    cin>>n;
    for (int i=0;i<n;++i) cin>>a[i];
    sort(a,a+n);
    for (int c=1;c<=pow(1e12, 1.0/(n-1));++c) {
        int sum=0,p=1;
        for(int j=0;j<n;j++) sum+=abs(p-a[j]),p*=c;
        ans=min(ans,sum);
    }
    cout<<ans<<endl;
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
//    cin>>_;
    while (_--) {
        solve();
    }
    return 0;
}

C. Multiples of Length

#include <bits/stdc++.h>
#define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
using namespace std;

int a[maxn];

void solve() {
    int n;
    cin>>n;
    for(int i=1;i<=n;++i) cin>>a[i];
    cout<<"1 1"<<endl<<a[1]*(n-1)<<endl;
    n==1?cout<<"1 1"<<endl<<"0":cout<<"2 "<<n<<endl;
    for (int j=2;j<=n;++j)cout<<a[j]*(n-1)<<" ";
    cout<<endl<<"1 "<<n<<endl;
    for(int i=1;i<=n;i++)cout<<-a[i]*n<<" ";
}

signed main() {
    //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
//    cin>>_;
    while (_--) {
        solve();
    }
    return 0;
}