河南农业大学训练赛标程

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e9 + 10;
const int mod = 1e9 + 7;
int (){
	int t;
	scanf("%d", &t);
	while (t--){
		int n;
		scanf("%d", &n);
		ll a, min_ = maxn, max_ = -maxn;
		for (int i = 0; i < n; i++){
			scanf("%lld", &a);
			if (a>max_)max_ = a;
			if (a < min_)min_ = a;
		}
		printf("%lld %lldn", max_, min_);
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e9 + 10;
const int mod = 1e9 + 7;
int num[120];
int (){
	int t;
	scanf("%d", &t);
	while (t--){
		int n,a;
		memset(num, 0, sizeof(num));
		scanf("%d", &n);
		for (int i = 0; i < n; i++){
			scanf("%d", &a);
			num[a]++;
		}
		int b = 0;
		a = 0;
		for (int i = 0; i <= 100; i++){
			if (num[i] >= a)b = i,a=num[i];
		}
		printf("%dn", b);

	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 10;
const int mod = 1e9 + 7;
int a[] = { 15, 25};
int dp[maxn];
int (){
	int t;
	scanf("%d", &t);
	while (t--){
		int n;
		scanf("%d", &n);
		memset(dp, 0, sizeof(dp));
		dp[0] = 1; 
		for (int i = 10; i <= n * 10; i+=5){
			for (int j = 0; j < 2; j++){
				if (i >= a[j]){
					dp[i] += dp[i - a[j]];
				}
			}
		}
		printf("%dn", dp[n * 10]);
	}
	return 0;
}