PAT b1046-b1049题解

最新推荐文章于 2020-06-03 15:27:18 发布

a18779148177

最新推荐文章于 2020-06-03 15:27:18 发布

阅读量370

点赞数 1

分类专栏： c/c++ oj 数据结构和算法文章标签： PAT cc++ 编程语言程序设计 oj

本文链接：https://blog.csdn.net/a18779148177/article/details/75094406

版权

c/c++ 同时被 3 个专栏收录

122 篇文章 0 订阅

订阅专栏

数据结构和算法

120 篇文章 0 订阅

订阅专栏

109 篇文章 0 订阅

订阅专栏

1、b1046

#include <cstdio>
int main(){
	int ha = 0, hb = 0;
	int n;
	scanf("%d", &n);
	while(n--){
		int a1, a2, b1, b2;
		scanf("%d%d%d%d", &a1, &a2, &b1, &b2);
		if(a1 + b1 == a2 && a1 + b1 != b2){
			hb++;
		}
		else if(a1 + b1 == b2 && a1 + b1 != a2){
			ha++;
		}
	}
	printf("%d %d", ha, hb);
}

2、b1047

#include <cstdio>

const int maxn = 1010;
int hashTable[maxn] = {0};
int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		int team, member, score;
		scanf("%d-%d %d", &team, &member, &score);
		hashTable[team] += score;
	}
	int k, max = -1;
	for(int i = 0; i < maxn; i++){
		if(hashTable[i] > max){
			k = i;
			max = hashTable[i];
		}	
	}
	printf("%d %d\n", k, max);
	return 0;
}

3、b1048

#include <cstdio>
#include <cstring>

const int maxn = 110;
char A[maxn], B[maxn], ans[maxn] = {0};

void reverse(char s[]){
	int len = strlen(s);
	for(int i = 0; i < len / 2; i++){
		int temp = s[i];
		s[i] = s[len - 1 - i];
		s[len - 1 - i] = temp;
	}
}

int main(){
	scanf("%s %s", A, B);
	reverse(A);
	reverse(B);
	int lenA = strlen(A);
	int lenB = strlen(B);
	int len = lenA > lenB ? lenA : lenB;
	for(int i = 0; i < len; i++){
		int numA = i < lenA ? A[i] - '0' : 0;
		int numB = i < lenB ? B[i] - '0' : 0;
		if(i % 2 == 0){
			int temp = (numB + numA) % 13;
			if(temp == 10){
				ans[i] = 'J';
			}
			else if(temp == 11){
				ans[i] = 'Q';
			}
			else if(temp == 12){
				ans[i] = 'K';
			}
			else{
				ans[i] = temp + '0';
			}
		}
		else{
			int temp = numB - numA;
			if(temp < 0){
				temp += 10;
			}
			ans[i] = temp + '0';
		}
	}
	reverse(ans);
	puts(ans);
	return 0;
}

4、b1049

#include <cstdio>
int main(){
	int n;
	double v, ans = 0;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lf", &v);
		ans += v * i * (n + 1 -i);
	}
	printf("%.2f\n", ans);
	return 0;
}