郑大 战役杯（6）（最后一场）

1

 

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin>>t;
	for(int i = 1;i<=t;i++){
		int n;
		cin>>n;		
		if(n%2||n<12){
			cout<<"-1";//奇数 
			if(i!=t){
				cout<<endl;
			}
		}else{
			if(n%12==0){
				cout<<"0";
				if(i!=t){
					cout<<endl;
				}
			}else{
				cout<<2;
				if(i!=t){
					cout<<endl;
				}
			}
		}
	}
	return 0;
}

2.

 

 

 

#include<bits/stdc++.h>
using namespace std;
#define int long long 
int x1[110],y1[110],x2[110],y2[110];
int main(){
	int n;
	cin>>n;
	int ans = 0;
	for(int i = 0;i<n;i++) cin>>x1[i]>>y1[i]>>x2[i]>>y2[i];
	for(int i = 0;i<n;i++){
		ans+=(x2[i]-x1[i])*2+(y2[i]-y1[i])*2;
		for(int j = 0;j<i;j++){
			if(x1[i]==x2[j]||x1[j]==x2[i])
			ans-=max(0ll,min(y2[i],y2[j])-max(y1[i],y1[j]));
			else if(y1[i] == y2[j]||y2[i]==y1[j])
			ans-=max(0ll,min(x2[i],x2[j])-max(x1[i],x1[j]));
			
		}
	}
		
	cout<<ans<<endl;
	return 0;
}

 3.

 wa了，模拟题不好处理

4.

 

 

#include<iostream>
#include<algorithm>

using namespace std;
int main() {
	int n;
	cin >> n;
	int a[6], b[6];
	char m = 'A';
	char m1;
	int ans = 1;
	for (int i = 0; i < n; i++, ans++) {
		for (int i = 0; i < 6; i++) {
			cin >> a[i];
			b[i] = a[i];
		}
		int x = min({ a[0],a[1],a[2],a[3],a[4],a[5] });
		int min1 = a[0];
		int min2 = 0;
		sort(b, b + 6);
		if (b[0] != b[1]) {
			for (int i = 0; i < 6; i++) {
				if (a[i] < min1) {
					min1 = a[i];
					min2 = i;
				}
			}
			m1 = m + min2;
			cout << m1;
			if (ans != n) {
				cout << endl;
			}
		}
		else {

			for (int i = 0; i < 5; i++) {
				if (a[i] == x) {
					min2 = i;
					break;
				}

			}

			m1 = m + min2;
			cout << m1;
			if (ans != n) {
				cout << endl;
			}

		}
	}
	return 0;
}