201312-1(出现次数最多的数),201312-2(ISBN号码)

//201312-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);

    map<int, int> m;
    
    for (int i = 0; i < n; i++) {    
        int num;
        scanf("%d", &num);
        m[num]++;
    }

    int maxNum = 0, maxCount = 0;
    for (auto it:m)
        if (it.second > maxCount)
            maxNum = it.first, maxCount = it.second;

    printf("%d\n", maxNum);
    return 0;
}

//201312-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, num, res = 0, cnt = 0;
    scanf("%d", &n);

    map<int, int> m;
    while (n--) scanf("%d", &num), m[num]++;
    for (auto it:m) if (it.second > cnt) cnt = it.second, res = it.first;
    printf("%d\n", res);

    return 0;
}

//201312-2
#include <bits/stdc++.h>

using namespace std;

int main() {
    char str[15];
    scanf("%s", str);
    int arr[9] = {0};
    int index = 0;
    for (int i = 0; i < 11; i++)
        if (i != 1 && i != 5)
            arr[index++] = str[i] - '0';

    int sum = 0;
    for (int i = 0; i < 9; i++)
        sum += (arr[i] *= (i + 1));
    sum %= 11;

    if (sum == 10) {
        if (str[12] == 'X')
            printf("Right");
        else {
            str[12] = 'X';
            printf("%s", str);
        }
    } else {
        if (str[12] - '0' == sum)
            printf("Right");
        else {
            str[12] = sum + '0';
            printf("%s", str);
        }
    }
    return 0;
}

//201312-2
#include <bits/stdc++.h>

using namespace std;

int main() {
    vector<int> v;
    for (int i = 1; i <= 9; i++)
        v.emplace_back(i);

    vector<int> temp(10);

    int cnt = 0;
    vector<char> c(13);
    int idx = 0;
    for (int i = 0; i < 12; i++) {
        scanf("%c", &c[i]);
        if (i != 1 && i != 5 && i != 11)
            cnt += (c[i] - '0') * v[idx++];
    }

    scanf("%c", &c[12]);
    if (c[12] != 'X') {
        if (cnt % 11 == c[12] - '0') {
            printf("Right");
            return 0;
        }
    } else {
        if (cnt % 11 == 10) {
            printf("Right");
            return 0;
        }
    }

    for (int i = 0; i < 12; i++)
        printf("%c", c[i]);
    if (cnt % 11 == 10)
        printf("X");
    else
        printf("%d", cnt % 11);


    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值