Codeforces Round #666 (Div. 2)

A：

简单是思维题

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>

using namespace std;

typedef long long ll;
const int N=1100;
char s[N][N];
int n;
int main()
{
	int t;
	scanf("%d",&t);
	char ch;
	while(t--){
		map<char,ll> mp;
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%s",s[i]+1);
			int len=strlen(s[i]+1);
			for(int j=1;j<=len;j++){
				mp[s[i][j]]++;
			}
		}
		bool flag=0;
		for(auto it=mp.begin();it!=mp.end();it++){
			ll temp=it->second;
			if(temp%n!=0){
				flag=1;
				break;
			}
		}
		if(flag) printf("NO\n");
		else printf("YES\n");
	} 
	
	
}

 

·

B

#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

typedef long long ll; 
const int N=1e5+10;
int n;
int a[N];
ll ans;
int main()
{
	cin>>n;
	ans=0;
	for(int i=0;i<n;i++) cin>>a[i];
	sort(a,a+n);
	for(int i=0;i<n;i++) ans+=a[i]-1;
	if(n>64){
		cout<<ans<<endl;
		return 0;
	}
	for(int i=2;i<N;i++){
		ll res=0,temp=1;
		for(int j=0;j<n;j++){
			res+=abs(a[j]-temp); 
			temp*=i;
		}
		if(temp>1e15) break;
		ans=min(ans,res);
	} 
	cout<<ans<<endl; 
	return 0;
}

C：

相关证明如下图所示

 

 

code：

#include<iostream>
#include<cstdio>

using namespace std;

typedef long long ll;
const int N=1e5+10;
int n;
ll a[N]; 
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	if(n==1){
		cout<<1<<" "<<1<<endl; 
		cout<<-a[1]<<endl;
		cout<<1<<" "<<1<<endl;
		cout<<0<<endl;
		cout<<1<<" "<<1<<endl;
		cout<<0<<endl;
		return 0;
	}
	cout<<1<<" "<<n-1<<endl;
	for(int i=1;i<=n-1;i++){
		cout<<a[i]*(n-1)<<" ";
//		a[i]+=(n-1)*a[i];
	}
	puts("");
	cout<<n<<" "<<n<<endl;
	cout<<-a[n]<<endl;
	a[n]=0;
	cout<<1<<" "<<n<<endl;
	for(int i=1;i<=n;i++){
		cout<<-n*a[i]<<" ";
	}
	puts("");
	return 0;
 }