「蓝桥·算法双周赛」第六场分级赛——小白入门赛

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,a[N];
int main() {
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<n;i++){
		if(i==0){
			cout<<a[n-1]+a[i+1]<<" ";
		}else if(i==n-1){
			cout<<a[i-1]+a[0]<<" ";
		}else{
			cout<<a[i-1]+a[i+1]<<" ";
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+5;
LL a[N],n;
int main() 
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]=abs(a[i]);
		a[i]+=a[i-1];
	}
	cout<<a[n];
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void solve(){
	LL n;
	cin >> n;
	if(n%8!=0||n==0){
		cout<<"No"<<'\n';
		return;
	}
	cout<<"Yes"<<'\n';
	LL x=n/8;
	cout<<2*x-1<<" "<<2*x+1<<'\n';
}

int main()
{
	int T;
	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int n,a[N],b[N];
long long ans;
int main() {
	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+n+1);
	sort(b+1,b+n+1);
	for(int i=1,j=1;i<=n;i++){
		if(a[i]*2>b[j]&&j<=n){
			ans++;
            j++;
		}
	}
	cout<<ans;
	return 0;
}

 

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int t;
void solve(){
	int k,m;
	cin>>k>>m;
	long long l=0,r=2e8+5;
	while(l<r){
		long long mid=l+r>>1;
		long long e=log(mid)/log(k);
		long double f=sqrt(mid)+e;
		if(f>m) r=mid;
		else l=mid+1;
	}
	cout<<l<<endl;
}
int main() {
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}