PAT B1041 考试座位号(15)

解题要点:

  1. 使用结构体保存准考证号,考试座位号
  2. 试机座位号作考生数组下标
  3. 通过试机座位号获取考生号,座位号
  4. 考生号使用long long存放
//课本AC代码
#include <cstdio>
const int maxn = 1010;
struct Student {
    long long id;
    int examSeat;
} testSeat[maxn];
int main() {
    int n, m, seat, examSeat;
    long long id;
    scanf("%d", &n);
    for(int i = 0; i < n; i++) {
        scanf("%lld %d %d", &id, &seat, &examSeat);
        testSeat[seat].id = id;
        testSeat[seat].examSeat = examSeat;
    }
    scanf("%d", &m);
    for(int i = 0; i < m; i++) {
        scanf("%d", &seat);
        printf("%lld %d\n", testSeat[seat].id, testSeat[seat].examSeat);
    }
    return 0;
}

自己的WA代码

#include <cstdio>

const int max_n = 1010;

struct Stu {
    long long no;   //准考证号
    int seat_num;
    int test_num;
} stu[max_n];

int main() {
    #ifdef ONLINE_JUDGE
    #else
        freopen("1.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    long long id;
    int seat, examSeat;
    int testSeat = 0;
    int n1 = 0, n2 = 0;
    scanf("%d", &n1);   //输入n个考生信息
    for(int i = 0; i < n1; i++) {
        scanf("%lld %d %d", &id, &seat, &examSeat);
        stu[i].no = id;
        stu[i].seat_num = seat;
        stu[i].test_num = examSeat;
    }
    scanf("%d", &n2);   //输入n个查询信息
    /*for(int i = 0; i < n1; i++) {
        printf("%lld %d %d\n ", stu[i].no, stu[i].seat_num, stu[i].test_num);
    }
    for(int i = 0; i < n2; i++) {
    }*/
    //误人子弟写法, 复杂度变高了不止, 还wa
    for(int i = 0; i < n2; i++) {
        scanf("%d", &testSeat);
        for(int j = 0; j < n1; j++) {
            if(testSeat == stu[j].test_num) {
                printf("%lld %d\n", stu[i].no, stu[i].test_num);
            }
        }
    }

    return 0;
}

转载于:https://www.cnblogs.com/isChenJY/p/11252047.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值