2020 PAT 甲级春季题解

第一题

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
bool isPrime(int x) {
	if(x < 2) return false;
	for(int i = 2; i <= sqrt(x); ++i) if(x % i == 0) return false;
	return true; 
}
int cnt;
int main() {
	string s, t;
	cin >> s;
	for(int i = 0; i < s.length(); ++i) {
		t = s.substr(i);
		cout << t;
		if(isPrime(stoi(t))) {
			printf(" Yes\n");
			++cnt;
		} else printf(" No\n");
	}
	if(cnt == s.length()) printf("All Prime!\n");
	return 0;
}

第二题

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<vector>
using namespace std;
const int N = 1010;
bool sub[N], dip[N];
int a, b, n, m, c;
vector<vector<int> > v;
int main() {
	scanf("%d%d", &a, &b);
	dip[a] = dip[b] = 1;
	sub[abs(a -  b)] = 1; 
	scanf("%d%d", &n, &m);
	vector<int> dis(n, 0), cnt;
	cnt.push_back(a), cnt.push_back(b);
	v.resize(n);
	for(int i = 0; i < n; ++i) {
		v[i].resize(m);
		for(int j = 0; j < m; ++j) scanf("%d", &v[i][j]);
	}
	for(int j = 0; j < m; ++j) {
		vector<int> lose;
		for(int i = 0; i < n; ++i) {
			if(dis[i]) continue;
			if(sub[v[i][j]] && !dip[v[i][j]]) {
				for(int k = 0; k < cnt.size(); ++k) sub[abs(v[i][j] - cnt[k])] = 1;
				cnt.push_back(v[i][j]);
				dip[v[i][j]] = 1;
			} else {
				lose.push_back(i);
				dis[i] = 1;
			}
		}
		for(int i = 0; i < lose.size(); ++i) printf("Round #%d: %d is out.\n", j + 1, lose[i] + 1);
	}
	int num = 0;
	for(int i = 0; i < n; ++i) if(!dis[i]) ++num;
	if(num) {
		printf("Winner(s):");
		for(int i = 0; i < n; ++i) if(!dis[i]) printf(" %d", i + 1);
		printf("\n");
	} else printf("No winner.\n");
	return 0;
}

第三题

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<unordered_set>
#include<vector>
using namespace std;
struct node {
	int u, v;
};
int n, r, k, m;
int main() {
	scanf("%d%d%d", &n, &r, &k);
	vector<node> dis(r);
	vector<int> col(n);
	for(int i = 0; i < r; ++i) scanf("%d%d", &dis[i].u, &dis[i].v);
	scanf("%d", &m);
	for(int i = 0; i < m; ++i) {
		unordered_set<int> s;
		for(int j = 0; j < n; ++j) {
			scanf("%d", &col[j]);
			s.insert(col[j]);
		}
		if(s.size() > k) printf("Error: Too many species.\n");
		else if(s.size() < k) printf("Error: Too few species.\n");
		else {
			bool flag = true;
			for(int j = 0; j < r; ++j) if(col[dis[j].u] == col[dis[j].v]) {
				flag = false;
				break;
			}
			if(flag) printf("Yes\n");
			else printf("No\n"); 
		}
	}
	return 0;
}

第四题

#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
priority_queue<int, vector<int>, greater<int> > q[2];
vector<int> res[N];
int n, m, f, s = 1, cnt;
int main() {
	scanf("%d%d", &n, &m);
	vector<int> ans(n);
	for(int i = 0; i < n; ++i) {
		scanf("%d", &ans[i]);
	}
	for(int i = 0; i < m; ++i) q[f].push(ans[i]);
	for(int i = m; i < n; ++i) {
		int x = q[f].top(); 
		q[f].pop();
		res[cnt].push_back(x);
		if(x <=  ans[i]) q[f].push(ans[i]);
		else q[s].push(ans[i]);
		if(q[f].size() == 0) {
			swap(f, s);
			++cnt;
		}
	}
	while(q[f].size()) {
		res[cnt].push_back(q[f].top()), q[f].pop();
	}
	++cnt;
	swap(f, s);
	while(q[f].size()) {
		res[cnt].push_back(q[f].top()), q[f].pop();
	}
	for(int i = 0; i <= cnt; ++i) {
		for(int j = 0; j < res[i].size(); ++j) {
			printf("%d%c", res[i][j], j == res[i].size() - 1 ? '\n' : ' ');
		}
	} 
	return 0;
}