第四周周报

1.B4096 [CSP-X2022 山东] 独木桥

#include<bits/stdc++.h>
#define ll long long
const long long N = 1e9 + 10;
using namespace std;


int main() {
	int n;
	cin >> n;
	cin.ignore();
	vector<int>s;
	for(int i = 0; i < n; i ++){
		string a;
		getline(cin,a);
		stringstream b(a);
		int temp;
		while(b >> temp){
			s.push_back(temp);
		}
	}
	sort(s.begin(),s.end());
//	for(int i = 0; i < s.size(); i ++){
//		cout << s[i] << ' ';
//	}
	for(int i = 1; i < s.size(); i ++){
		if(s[i] - s[i - 1] == 2){
			cout << s[i] - 1 << ' ';
		}
		if(s[i - 1] == s[i]){
			cout << s[i-1] << endl;
		}
	}
	return 0;
}

P10424 [蓝桥杯 2024 省 B] 好数

#include<bits/stdc++.h>
#define ll long long
const long long N = 1e9 + 10;
using namespace std;

int haoshu(int x){
	int i = 1;
	while(x != 0){
		if((x % 10) % 2 != 0 && i % 2 != 0){
			i ++;
			x /= 10;
		}else if((x % 10) % 2 == 0 && i % 2 == 0){
			i ++;
			x /= 10;
		}else{
			break;
		}
	}
	return x;
	
}

3.L1-5 猜帽子游戏 

#include<bits/stdc++.h>
#define ll long long
const long long N = 1e9 + 10;
using namespace std;

int main() {
	int n;
	cin >> n;
	int a[110];
	for(int i = 0; i < n; i ++){
		cin >> a[i];
	}
	int k;
	cin >> k;
	while(k--){
		int b[110];
		for(int i = 0; i < n; i ++){
			cin >> b[i];
		}
		bool ok1 = false;
		bool ok2 = false;
		bool ok3 = false;
		for(int i = 0; i < n; i ++){
			if((a[i] == 1 && b[i] == 2) || (a[i] == 2 && b[i] == 1)){
				ok1 = true;
				break;
			}else if((a[i] == 1 && b[i] == 1) || (a[i] == 2 && b[i] == 2)){
				ok2 = true;
			}else if((a[i] == 1 && b[i] == 0) || (a[i] == 2 && b[i] == 0)){
				ok3 = true;
			}
		}
		if(ok1 || (!ok2 && ok3)){
			cout << "Ai Ya" << endl;
		}else if(ok2){
			cout << "Da Jiang!!!" << endl;
		}
	}
	
	return 0;
}

4. L1-7 分寝室

#include<bits/stdc++.h>
#define ll long long
const long long N = 1e9 + 10;
using namespace std;

int main() {
	int n0,n1,n;
	cin >> n0 >> n1 >> n;
	int min = 1000000;
	int res1 = 0;
	int res2 = 0;
	bool ok = false;
	for(int i = 1;i < n; i ++){
		if(n0 % i == 0 && n1 % (n - i) == 0){
			int a = n0 / i;//女生人数
			int b = n1 / (n - i);//男
			if(a > 1 && b > 1){
				int t = abs(a - b);
				if(min > t){
					min = t;
					res1 = i;
					res2 = n-i;
				}
				ok = true;	
			}
		}
	}
	if(ok){
		cout << res1 << ' ' << res2 << endl;	
	}else{
		cout << "No Solution" << endl;
	}
	
	return 0;
}

5.L1-8 谁管谁叫爹 

#include<bits/stdc++.h>
#define ll long long
const long long N = 1e9 + 10;
using namespace std;

ll sum(ll a){
	ll s = 0;
	while(a != 0){
		int t = a % 10;
		s += t;
		a /= 10;
	}
	return s;
}

int main() {
	int n;
	cin >> n;
	while(n--){
		ll a;
		ll b;
		cin >> a >> b;
		ll sa = sum(a);
		ll sb = sum(b);
		if(a % sb == 0 && b % sa != 0){
			cout << 'A' << endl;
		}else if(b % sa == 0 && a % sb != 0 ){
			cout << 'B' << endl;
		}else if((a % sb == 0 && b % sa == 0) || (b % sa != 0 && a % sb != 0)){
			if(a > b){
				cout << 'A' << endl;
			}else if(b > a){
				cout << 'B' << endl;
			}
		}
	}
	
	return 0;
}