暂存模拟六代码

function

#include<iostream>
#include<cstdio> 
using namespace std;
long long power(long long n,long long n1){
	long long sum=1;
	for(int i=1;i<=n1;i++){
		sum=sum*n;
	}
	return sum;
}
long long f(long long n){
	return 2*power(n,3)-2*power(n,2)+90;
} 
int main(){
	freopen("function.in","r",stdin);
	freopen("function.out","w",stdout);
	long long n;
	scanf("%lld",&n);
	long long a;
	for(int i=1;i<=n;i++){
		scanf("%lld",&a);
		printf("%lld",f(a));
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
} 

harvest

#include<iostream>
#include<cstdio>
using namespace std;	
int main(){
	freopen("harvest.in","r",stdin);
	freopen("harvest.out","w",stdout);
	int n;
	cin>>n;
	for(int i=1;i<=(n/2)-1;i++){
		cout<<i<<" ";
	}
	cout<<n<<endl;
	for(int i=(n/2);i<=n-1;i++){
		cout<<i<<" ";
	}
	fclose(stdin);
	fclose(stdout);
}

nest

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
	freopen("nest.in","r",stdin);
	freopen("nest.out","w",stdout);
	int n;
	cin>>n;
	int a[1005],maxcnt=0,mincnt=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]>0){
			maxcnt++;
		}
		else{
			mincnt++;
		}
	}
	for(int i=1;i<=maxcnt;i++){
		cout<<i<<" ";
	}
	for(int i=maxcnt-1;i>=mincnt;i--){
		cout<<i<<" ";
	}
	cout<<endl;
	int dq=1,jl=0;
	for(int i=1;i<=maxcnt;i++){
		cout<<dq<<" ";
		if(jl<mincnt){
			jl++;
			dq-=1;
			cout<<dq<<" ";
		}
		dq++;
	}
	fclose(stdin);
	fclose(stdout);
}

pair

#include<iostream>
#include<cstdio> 
using namespace std;
int main(){
	freopen("pair.in","r",stdin);
	freopen("pair.out","w",stdout);
	long long n;
	cin>>n;
	long long t;
	for(int i=1;i<=n;i++){
		cin>>t;
		cout<<(t-1)/2;
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}