zoukankan      html  css  js  c++  java
  • 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
    ", 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
     ", 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
    ", stu[i].no, stu[i].test_num);
    			}
    		}
    	}
    
    	return 0;
    }
    
  • 相关阅读:
    nodejs下载图片保存本地
    anaconda基本命令
    1.购买腾讯学生服务器遇到的坑
    git 命令
    JS深拷贝递归实现
    Object.prototype.toString()
    Spring核心知识点
    Spring核心知识点
    Spring核心知识点
    Spring基础知识点
  • 原文地址:https://www.cnblogs.com/isChenJY/p/11252047.html
Copyright © 2011-2022 走看看