机试指南

1.冒泡排序

#include <stdio.h>
int main(){
    int i,j,n,temp;
    int a[100];
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
        }
    for(i=0;i<n-1;i++){
        for(j=0;j<n-i-1;j++){
            if(a[j]>a[j+1]){
                temp = a[j];
                a[j]=a[j+1];
                a[j+1] = temp;
            }
        }
    }
    for(i=0;i<n;i++){
        printf("%d ",a[i]);
    }
    printf("
");
}
return 0;
}

2.qsort实现快速排序--优点：不易出错，速度快

3.结构体排序（成绩排序）---2000清华复试

将学生按照成绩排序，成绩相同则按照学生名字，若仍相同，按照年龄；

样例输入：         对应输出
3
abc 18 93       abc 18 93 
ecd 19 97       ecd 19 97
ecd 20 97       ecd 20 97 

4.日期差值

样例输入                     对应输入

20130101                        5

20130105

#include <stdio.h>
#include <math.h>
int yeap(year){
    return (year % 4==0&& year % 100 !=0)||(year % 400 == 0);
}
int day(int Y, int M, int D){
    int distance = 0;
    int month[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
    if(yeap(Y)) month[1] = 29;
    for(int i=1; i<M; i++){
        distance = distance +  month[i-1];
    }
    return (distance + D);
}
int main(int argc, char const *argv[]){
    int y1,m1,d1,y2,m2,d2,lab;
    while(scanf("%4d%2d%2d",&y1,&m1,&d1)!= EOF){
        scanf("%4d%2d%2d",&y2,&m2,&d2);
    int result = 0;
    if(y1!=y2){
        for(int i=y1;i<y2;i++){
            printf("%d-%d
",i,i+1 );
            if(yeap(i)) result += 366;
            else result += 365;
        }
    }
    result = result + day(y2, m2,d2) - day(y1,m1,d1);
    printf("%d
", result);
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Student{
    char name[100];
    int age;
    int score;
}stu;
int compfunc(void const *a, void const *b){
    if((*(stu *)a).score!=(*(stu *)b).score) return (*(stu *)a).score-(*(stu *)b).score;
    int temp = strcmp((*(stu *)a).name,(*(stu *)b).name);
    if(temp!=0) return temp < 0;
    else return (*(stu *)a).age-(*(stu *)b).age;
}
int main(int argc, char const *argv[]){
    int n,i,j;
    stu mates[100];
    while(scanf("%d",&n)!=EOF){
        for (int i = 0; i < n; ++i){
            scanf("%s %d %d", mates[i].name, &mates[i].age, &mates[i].score);
        }
        qsort(mates,n,sizeof(int)*2+sizeof(char)*100,compfunc);
        for (int i = 0; i < n; ++i){
            printf("%s %d, %d
", mates[i].name, mates[i].age, mates[i].score);
        }
    }
    return 0;
}