计算机挑战赛2

数组a和b分别记录着球队A和B本赛季N场比赛的净胜球，其中正数为胜利积3分，负18、数为失败积0分，0为平局积1份，求解A和B的排名先后。如果积分相同则净胜球总数多则排名靠前。如果净胜球总数仍相同，则输出:Draw。输入说明:第一行，数组中元素个数N(N<1000);第二行，A的净胜球;第三行，B的净胜球 输出说明:排名靠前球队(A或B或Draw)

输入样例:

5

1 0 -1 0 1

0 6 0 0 -1

输出样例:

A

代码：
C++：

#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ag = 0;
int bg = 0;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
if (num > 0) {
ag += 3;
}
else if (num == 0) {
ag += 1;
}
}
for (int i = 0; i < n; i++) {
int num; cin >> num;
if (num > 0) bg += 3;
else if (num == 0) bg += 1;
}
if (ag > bg) {
cout << "A" << endl;
}
else if (bg > ag) {
cout << "B" << endl;
}
else if (bg == ag) {
cout << "Draw" << endl;
}
return 0;
}

python：

n = int(input())
ag = 0
bg = 0
num1 = map(int, input().split())
for i in num1:
    if i > 0:
        ag += 3
    elif i == 0:
        ag += 1
num2 = map(int, input().split())
for i in num2:
    if i > 0:
        bg += 3
    elif i == 0:
        bg += 1
if ag > bg:
    print("A")
elif bg > ag:
    print("B")
else:
    print("Draw")

Java：

package com.my.gududu;

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int ag = 0;
        int bg = 1;
        for (int i = 0; i < n; i++) {
            int num; num = input.nextInt();
            if (num > 0) {
                ag += 3;
            }
            else if (num == 0) {
                ag += 1;
            }
        }
        for (int i = 0; i < n; i++) {
            int num; num = input.nextInt();
            if (num > 0) bg += 3;
            else if (num == 0) bg += 1;
        }
        if (ag > bg) System.out.println("A");
        else if (bg > ag) System.out.println("B");
        else System.out.println("Draw");
    }
}

原文地址：https://blog.csdn.net/2401_82661391/article/details/142851233

免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！