算法笔记_第三章

第三章书上的题目+Codeup+上机训练

3(书)

3.1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1032
int main()
{
    int total_score[100000];
    memset(total_score,0,sizeof(total_score));  //数组每个元素赋零
    int n=0;
    scanf("%d",&n);  //n行
    int school_ID,school_SCORE;
    for(int i=0;i<n;i++){
        scanf("%d%d",&school_ID,&school_SCORE);
        total_score[school_ID-1]+=school_SCORE;
    }
    int max_id=0,max_score=0;
    for(int i=0;i<n;i++){
        if(total_score[i]>max_score){
            max_score=total_score[i];
            max_id=i+1;
        }
    }
    printf("%d %d\n",max_id,max_score);
    return 0;
}

/*
PAT B1001
int main()
{
    int n,step=0;
    scanf("%d",&n);  //n<=1000
    while(n!=1){
        if(n%2==0){
            n/=2;
            step++;
        }
        else{
            n*=3;
            n+=1;
            n/=2;
            step++;
        }
    }
    printf("%d",step);
    return 0;
}
*/

3.3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1036
int main()
{
    int col=0;
    int row=0;
    char c;
    scanf("%d %c",&col,&c);
    if(col%2==0) row=col/2;
    else row=col/2+1;
    for(int i=0;i<col;i++) printf("%c",c);
    printf("\n");
    for(int i=2;i<row;i++){
        printf("%c",c);
        for(int j=0;j<col-2;j++) printf(" ");
        printf("%c\n",c);
    }
    for(int i=0;i<col;i++) printf("%c",c);
    return 0;
}

3.4

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//Codeup 1928
//A
//以下答案会超时，不过只想研究一下基本做法，没做深究
bool runNian(int year){
        return (year%4==0&&year%100!=0) || (year%400==0);
    }

int main()
{
    int day[13][2]={{0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31}};
    int time_1,time_2;
    while(scanf("%d%d",&time_1,&time_2)!=EOF){
        if(time_1>time_2){
            int temp=time_1;
            time_1=time_2;
            time_2=temp;
        }
        int y1=time_1/10000,m1=time_1%10000/100,d1=time_1%100;
        int y2=time_2/10000,m2=time_2%10000/100,d2=time_2%100;
        int sum=1;
        while(y1<y2||m1<m2||d1<d2){
            d1++;
            if(d1==day[m1][runNian(y1)+1]){
                m1++;
                d1=1;
            }
            if(m1==13){
                y1++;
                m1=1;
            }
            sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}

3.5

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1022
int main()
{
    long long A,B;
    int D;
    scanf("%lld%lld%d",&A,&B,&D);
    long long sum=A+B;
    int ans[100000]={0};
    int num=0;
    do{
        ans[num++]=sum%D;
        sum/=D;
    }while(sum!=0);
    for(int i=num-1;i>=0;i--)
        printf("%d",ans[i]);
    return 0;
}

3.6

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1009
int main()
{
    char s[81];
    char s2[81][81];
    int num=0;
    while(scanf("%s",s2[num])!=EOF){
        num++;
    }
    for(int i=num-1;i>0;i--){
        printf("%s ",s2[i]);
    }
    printf("%s",s2[0]);
    return 0;
}

3(Codeup)

3.1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//E
//PAT A1046
//第三组数据超时了
int main()
{
    int N;
    int D[100001];
    int M;
    int sum=0;
    scanf("%d",&N);
    for(int i=1;i<=N;i++){
        scanf("%d",&D[i]);
        sum+=D[i];
    }
    scanf("%d",&M);
    int a,b;
    int d[100001];
    for(int i=0;i<M;i++){
        int distance=0;
        int temp_a,temp_b;
        scanf("%d%d",&a,&b);
        temp_a=min(a,b);
        temp_b=max(a,b);
        for(int i=temp_a;i<temp_b;i++){
            distance+=D[i];
        }
        d[i]=min(distance,sum-distance);
    }
    for(int i=0;i<M;i++)
        printf("%d\n",d[i]);
    return 0;
}

//优化
int main()
{
    int N;
    int D[100001];
    int M;
    int sum=0;
    scanf("%d",&N);
    int temp=0;
    for(int i=1;i<=N+1;i++){
        if(i==1)
            D[i]=0;
        else{
            scanf("%d",&temp);
            D[i]=temp+D[i-1];
        }
        sum+=temp;
    }
    scanf("%d",&M);
    int a,b;
    int d[100001];
    for(int i=0;i<M;i++){
        int distance=0;
        int temp_a,temp_b;
        scanf("%d%d",&a,&b);
        temp_a=min(a,b);
        temp_b=max(a,b);
        distance=D[temp_b]-D[temp_a];
        d[i]=min(distance,sum-distance);
    }
    for(int i=0;i<M;i++)
        printf("%d\n",d[i]);
    return 0;
}




/*
A
int main()
{
    int L,M;  //1<=L<=10000;1<=M<=100
    while(scanf("%d%d",&L,&M)!=EOF,L||M){
        int a=100,b=0;  //左右端点
        int rest=0;
        while(M--){
            int temp_a,temp_b;
            scanf("%d%d",&temp_a,&temp_b);
            a=min(a,temp_a);
            b=max(b,temp_b);
        }
        rest=(L+1)-(b-a+1);
        printf("%d\n",rest);
    }
    return 0;
}
*/

/*
D
int main(){
    int n,i,EvenNum=0,OddNum=0;
    int Array[1000];
    memset(Array,0,sizeof(Array));
    while(scanf("%d",&n)!=EOF){
        for(i=0;i<n;i++)scanf("%d",&Array[i]);
        for(i=0;i<n;i++){
            if(Array[i]%2==0)EvenNum++;
            else OddNum++;
        }
        if(EvenNum>OddNum) printf("NO\n");
        else printf("YES\n");
        EvenNum=0;
        OddNum=0;
    }
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//I
//PAT B1018
int main()
{
    int N=0;
    scanf("%d",&N);
    int a_win=0,a_lose=0,sum=N;
    int C_win=0,J_win=0,B_win=0;
    int C_lose=0,J_lose=0,B_lose=0;
    char a,b;
    while(N--){
        getchar();
        a=getchar();
        getchar();
        b=getchar();
        //printf("%c %c\n",a,b);
        if(a=='C'&&b=='J'){
            a_win++;
            C_win++;
        }
        else if(a=='J'&&b=='B'){
            a_win++;
            J_win++;
        }
        else if(a=='B'&&b=='C'){
            a_win++;
            B_win++;
        }
        else if(a=='J'&&b=='C'){
            a_lose++;
            J_lose++;
        }
        else if(a=='C'&&b=='B'){
            a_lose++;
            C_lose++;
        }
        else if(a=='B'&&b=='J'){
            a_lose++;
            B_lose++;
        }
    }
    char a_win2;
    char b_win2;
    if(B_win>=C_win){
        a_win2='B';
        if(J_win>B_win)
            a_win2='J';
    }
    if(C_win>B_win){
        a_win2='C';
        if(J_win>C_win)
            a_win2='J';
    }
    if(C_lose>=J_lose){  //B_win>C_win
        b_win2='B';
        if(B_lose>C_lose)
            b_win2='J';
    }
    if(J_lose>C_lose){
        b_win2='C';
        if(B_lose>J_lose)
            b_win2='J';
    }
    printf("%d %d %d\n",a_win,sum-a_win-a_lose,a_lose);
    printf("%d %d %d\n",a_lose,sum-a_win-a_lose,a_win);
    printf("%c %c\n",a_win2,b_win2);
    //system("pause");
    return 0;
}

/*
//H
//PAT B1016
//这题有bug，提交上去是对的，但是第一组数据codeblocks里面算出来是398
int main()
{
    char A[11],B[11];
    char Da,Db;
    scanf("%s",A);
    getchar();
    scanf("%c",&Da);
    scanf("%s",B);
    getchar();
    scanf("%c",&Db);
    //printf("%s\n",A);
    //printf("%d\n",Da);
    //printf("%s\n",B);
    //printf("%d\n",Db);
    int count_a=0,count_b=0;
    for(int i=0;i<11;i++){
        if(A[i]==Da)
            count_a++;
        if(B[i]==Db)
            count_b++;
    }
    int sum_a=0,sum_b=0;
    while(count_a--){
        sum_a+=(((int)Da-48)*pow(10.0,count_a));
    }
    while(count_b--){
        sum_b+=(((int)Db-48)*pow(10.0,count_b));
    }
    //printf("%d\n",sum_a);
    //printf("%d\n",sum_b);
    printf("%d\n",sum_a+sum_b);
    return 0;
}
*/

/*
//G
//PAT B1012
int main()
{
    int N=0; //N<=1000
    int temp[1000];
    int A1=0,A2=0,A3=0,A5=0;
    int flag=0;
    double A4_sum=0.0,A4_count;
    scanf("%d",&N);
    for(int i=0;i<N;i++){
        scanf("%d",&temp[i]);
        if((temp[i]%2==0)&&(temp[i]%5==0))
            A1+=temp[i];
        if(temp[i]%5==2)
            A3++;
        if(temp[i]%5==3){
            A4_sum+=temp[i];
            A4_count++;
        }
        if(temp[i]%5==4)
            A5=max(A5,temp[i]);
        if(temp[i]%5==1){
            if(flag%2==0){
                A2+=temp[i];
                flag++;
            }
            else{
                A2-=temp[i];
                flag++;
            }
        }
    }
    if(A1==0)
        printf("N ");
    if(A1!=0)
        printf("%d ",A1);
    if(flag==0)
        printf("N ");
    if(flag!=0)
        printf("%d ",A2);
    if(A3==0)
        printf("N ");
    if(A3!=0)
        printf("%d ",A3);
    if(A4_sum==0)
        printf("N ");
    if(A4_sum!=0)
        printf("%.1f ",A4_sum/A4_count);
    if(A5==0)
        printf("N");
    if(A5!=0)
        printf("%d",A5);
    return 0;
}
*/

/*
//F
//PAT B1011
int main()
{
    int T;  //T<=10
    long long A,B,C;
    scanf("%d",&T);
    for(int i=1;i<=T;i++){
        scanf("%lld%lld%lld",&A,&B,&C);
        if((A+B)>C)
            printf("Case #%d: true\n",i);
        else
            printf("Case #%d: false\n",i);
    }
    return 0;
}
*/

3(上机训练)

3.1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//const int CLK_TCK=100;

//PAT B1010
int main()
{
    int a[1001]={0};
    int m,n;
    int cont=0;
    int n_max=0;
    while(scanf("%d%d",&m,&n)!=EOF){
        a[n]=m;
    }
    a[0]=0;
    for(int i=1;i<=1000;i++){
        a[i-1]=a[i]*i;
        a[i]=0;
        if(a[i-1]!=0) cont++;
    }
    if(cont==0) printf("0 0");
    else{
        for(int i=1000;i>=0;i--){
            if(a[i]!=0){
                printf("%d %d",a[i],i);
                cont--;
                if(cont!=0) printf(" ");
            }
        }
    }
    return 0;
}

/*
//PAT B1008
int main()
{
    int N=0,M=0;
    int A[200];
    scanf("%d%d",&N,&M);
    M=M%N;
    for(int i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    for(int i=N-M;i<N;i++){
        printf("%d ",A[i]);
    }
    for(int i=0;i<N-M-1;i++){
        printf("%d ",A[i]);
    }
    printf("%d",A[N-M-1]);
    return 0;
}
*/

/*
//PAT B1046
int main()
{
    int N;
    int a_drunk=0,b_drunk=0;
    int a_1,a_2,b_1,b_2;
    scanf("%d",&N);
    while(N--){
        scanf("%d%d%d%d",&a_1,&a_2,&b_1,&b_2);
        if((a_2==(a_1+b_1))&&(b_2!=(a_1+b_1)))
            b_drunk++;
        if((a_2!=(a_1+b_1))&&(b_2==(a_1+b_1)))
            a_drunk++;
    }
    printf("%d %d",a_drunk,b_drunk);
    return 0;
}
*/

/*
//PAT B1026
int main()
{
    int C1,C2;
    scanf("%d%d",&C1,&C2);
    int temp=C2-C1;
    if(temp%CLK_TCK>=50)
        temp=temp/CLK_TCK+1;
    else
        temp/=CLK_TCK;
    printf("%02d:%02d:%02d",temp/3600,temp%3600/60,temp%60);
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1042
int main()
{
    //正在写Bug
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <typeinfo>

using namespace std;

//PAT A1009
struct poly{
    int exp;
    double cof;
}N[1001];
int main()
{
    double sum[2001]={0.0};
    int K1,K2;
    int count=0;
    scanf("%d",&K1);
    for(int i=0;i<K1;i++){
        scanf("%d%lf",&N[i].exp,&N[i].cof);
    }
    scanf("%d",&K2);
    for(int i=0;i<K2;i++){
        int exp=0;
        double cof=0.0;
        scanf("%d%lf",&exp,&cof);
        for(int j=0;j<K1;j++){
            sum[exp+N[j].exp]+=(cof*N[j].cof);
        }
    }
    for(int i=0;i<=2000;i++)
        if(sum[i]!=0.0) count++;
    printf("%d",count);
    for(int i=2000;i>=0;i--){
        if(sum[i]!=0.0)
            printf(" %d %.1f",i,sum[i]);
    }
    return 0;
}

/*
//PAT A1002
int main()
{
    int K1,K2;
    double N[1001]={0.0};
    double M[1001]={0.0};
    int e;
    double c;
    scanf("%d",&K1);
    while(K1--){
        scanf("%d%lf",&e,&c);
        N[e]=c;
    }
    scanf("%d",&K2);
    while(K2--){
        scanf("%d%lf",&e,&c);
        M[e]=c;
    }
    int count=0;
    for(int i=0;i<1001;i++){
        double sum=0.0;
        sum=N[i]+M[i];
        if(sum!=0) count++;
        N[i]=sum;
    }
    printf("%d",count);
    for(int i=1000;i>=0;i--){
        if(N[i]!=0)
            printf(" %d %.1f",i,N[i]);
    }
    return 0;
}
*/

/*
//PAT A1065
int main()
{
    long long A,B,C;
    int T=0;
    scanf("%d",&T);
    int flag[T+1]={-1};
    for(int i=1;i<=T;i++){
        scanf("%lld%lld%lld",&A,&B,&C);
        long long sum=A+B;  //必须用long long 存放后才可与C比较
        if(A<0&&B<0&&sum>=0) flag[i]=0;
        else if(A>0&&B>0&&sum<0) flag[i]=1;
        else if(sum>C){
            flag[i]=1;
            //printf("Case #%d: true\n",i);
        }
        else{
            flag[i]=0;
            //printf("Case #%d: false\n",i);
        }
    }
    for(int i=1;i<=T;i++){
        if(flag[i]==1) printf("Case #%d: true\n",i);
        if(flag[i]==0) printf("Case #%d: false\n",i);
    }
    return 0;
}
*/

3.2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1028
struct person{
    char name[6];
    int year;
    int month;
    int day;
    int flag=1;
};

int main()
{
    person young;
    person old;
    old.year=2014;
    old.month=9;
    old.day=6;
    young.year=1814;
    young.month=9;
    young.day=6;
    int N=0;
    scanf("%d",&N);
    int valid=N;
    person town[N];
    for(int i=0;i<N;i++){
        scanf("%s %d/%d/%d",&town[i].name,&town[i].year,&town[i].month,&town[i].day);
        //printf("%s",town[i].name);
        if(town[i].year > 2014 || (town[i].year == 2014 && town[i].month > 9) || (town[i].year == 2014 && town[i].month == 9 && town[i].day > 6) || town[i].year < 1814 || (town[i].year == 1814 && town[i].month < 9) || (town[i].year == 1814 && town[i].month == 9 && town[i].day < 6)){
            valid--;
            town[i].flag=0;
        }
    }
    printf("%d",valid);
    for(int i=0;i<N;i++){
        //printf("%d",town[i].flag);
        if(town[i].flag==1){
           if(town[i].year < old.year || (town[i].year == old.year && town[i].month < old.month) || (town[i].year == old.year && town[i].month == old.month && town[i].day < old.day)){
                old=town[i];
                //printf("%s\n",old.name);
           }
        }
    }
    for(int i=0;i<N;i++){
        if(town[i].flag==1){
           if(town[i].year > young.year || (town[i].year == young.year && town[i].month > young.month) || (town[i].year == young.year && town[i].month == young.month && town[i].day > young.day)){
                young=town[i];
           }
        }
    }
    if(valid!=0){
        printf(" %s %s",old.name,young.name);
    }
    //system("pause");
    return 0;
}

/*
//PAT B1004
struct info{
    char name[11];
    char number[11];
    int score;
};

int main()
{
    int n;
    scanf("%d",&n);
    info student[n];
    for(int i=0;i<n;i++){
        scanf("%s%s%d",&student[i].name,&student[i].number,&student[i].score);
    }
    int min=100,max=0;
    int min_num=-1,max_num=-1;
    for(int i=0;i<n;i++){
        if(student[i].score<min){
            min=student[i].score;
            min_num=i;
        }
        if(student[i].score>max){
            max=student[i].score;
            max_num=i;
        }
    }
    printf("%s %s\n",student[max_num].name,student[max_num].number);
    printf("%s %s",student[min_num].name,student[min_num].number);
    return 0;
}
*/

/*
//PAT B1041
struct info{
    char num[17];
    int test;  //formal
};

int main()
{
    int N=0;
    scanf("%d",&N);
    info student[N];
    char temp[17];
    int t;
    int f;
    while(N--){
        scanf("%s%d%d",&temp,&t,&f);
        student[t-1].test=f;
        sprintf(student[t-1].num,"%s",temp);
    }
    int K=0;
    int a;
    scanf("%d",&K);
    while(K--){
        scanf("%d",&a);
        printf("%s %d\n",student[a-1].num,student[a-1].test);
    }
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1036
struct student{
    char name[11];
    char id[11];
    char gender;
    int grade;
}temp,f_max,m_min;

int main()
{
    f_max.grade=-1;
    m_min.grade=101;
    int N=0;
    scanf("%d",&N);
    while(N--){
        scanf("%s %c %s %d",temp.name,&temp.gender,temp.id,&temp.grade);
        //printf("%s\n",temp.name);
        //printf("%c\n",temp.gender);
        //printf("%s\n",temp.id);
        //printf("%d\n\n",temp.grade);
        if(temp.gender=='M'&&temp.grade<m_min.grade) m_min=temp;
        if(temp.gender=='F'&&temp.grade>f_max.grade) f_max=temp;
    }
    if(f_max.grade==-1)
        printf("Absent\n");
    else printf("%s %s\n",f_max.name,f_max.id);
    if(m_min.grade==101)
        printf("Absent\n");
    else printf("%s %s\n",m_min.name,m_min.id);
    if(f_max.grade==-1||m_min.grade==101)
        printf("NA");
    else
        printf("%d",f_max.grade-m_min.grade);
    //system("pause");
    return 0;
}

/*
//PAT A1006
struct person{
    char name[16];
    int hh,mm,ss;
}temp,late,early;

bool More(person node1,person node2){
    if(node1.hh!=node2.hh) return node1.hh>node2.hh;
    if(node1.mm!=node2.mm) return node1.mm>node2.mm;
    return node1.ss>node2.ss;
}

int main()
{
    int M=0;
    early.hh=24,early.mm=60,early.ss=60;
    late.hh=0,late.mm=0,late.ss=0;
    scanf("%d",&M);
    for(int i=0;i<M;i++){
        scanf("%s %d:%d:%d",temp.name,&temp.hh,&temp.mm,&temp.ss);
        if(More(temp,early)==false) early=temp;
        scanf("%d:%d:%d",&temp.hh,&temp.mm,&temp.ss);
        if(More(temp,late)==true) late=temp;
    }
    printf("%s %s\n",early.name,late.name);
    return 0;
}
*/

/*
//PAT A1011
int main()
{
    char condition[3]={'W','T','L'};
    double W,T,L;
    double max=0.0;
    double sum=1.0;
    double temp;
    int idx;
    for(int i=0;i<3;i++){
        max=0.0;
        for(int j=0;j<3;j++){
            scanf("%lf",&temp);
            if(temp>max){
                max=temp;
                idx=j;
            }
        }
        sum*=max;
        printf("%c ",condition[idx]);
    }
    sum=(sum*0.65-1)*2;
    printf("%.2f",sum);
    return 0;
}
*/

3.3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1031
//真TM难
//用二维数组存answer的形式
int main()
{
    char s[81];
    char ans[30][30];
    scanf("%s",s);
    int N=strlen(s);
    int n1=(N+2)/3;
    int n3=n1;
    int n2=N+2-n1-n3;
    for(int i=1;i<=n1;i++){
        for(int j=1;j<=n2;j++)
            ans[i][j]=' ';
    }
    int idx=0;
    for(int i=1;i<=n1;i++)
        ans[i][1]=s[idx++];
    for(int i=2;i<=n2;i++)
        ans[n1][i]=s[idx++];
    for(int i=n3-1;i>=1;i--)
        ans[i][n2]=s[idx++];
    for(int i=1;i<=n1;i++){
        for(int j=1;j<=n2;j++)
            printf("%c",ans[i][j]);
        printf("\n");
    }
    return 0;
}

/*
//PAT B1027
int main()
{
    int n;
    char c;
    scanf("%d %c",&n,&c);
    int x;
    x=floor(sqrt(2*(1+n)))-1;
    if(x%2==0) x--;
    int used=(x+1)*(1+x)/2-1;
    for(int i=x;i>=1;i-=2){
        for(int j=0;j<(x-i)/2;j++){
            printf(" ");
        }
        for(int j=0;j<i;j++)
            printf("%c",c);
        printf("\n");
    }
    for(int i=3;i<=x;i+=2){
        for(int j=0;j<(x-i)/2;j++){
            printf(" ");
        }
        for(int j=0;j<i;j++)
            printf("%c",c);
        printf("\n");
    }
    printf("%d",n-used);
    return 0;
}
*/

3.5

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT B1037
//自己写的，怎么改暂时都是18分，参考了一下答案，还是全换成最小单位再算简单明了
struct money{
    int Galleon;
    int Sickle;
    int Knut;
}temp,a,b;

bool more(money a,money b)
{
    if(a.Galleon!=b.Galleon) return a.Galleon>b.Galleon;
    if(a.Sickle!=b.Sickle) return a.Sickle>b.Sickle;
    return a.Knut>b.Knut;
}

int main()
{
    int x,y,z;
    scanf("%d.%d.%d",&a.Galleon,&a.Sickle,&a.Knut);
    scanf("%d.%d.%d",&b.Galleon,&b.Sickle,&b.Knut);
    if(!more(a,b)){
        temp=a;
        a=b;
        b=temp;
        //exe
        if(a.Knut-b.Knut<0){
            a.Knut+=29;
            a.Sickle--;
            if(a.Sickle<0){
                a.Sickle++;
                a.Galleon--;
            }
        }
        z=a.Knut-b.Knut;
        if(a.Sickle-b.Sickle<0){
            a.Sickle+=17;
            a.Galleon--;
        }
        y=a.Sickle-b.Sickle;
        x=a.Galleon-b.Galleon;
    }
    else{
        //exe
        if(a.Knut-b.Knut<0){
            a.Knut+=29;
            a.Sickle--;
            if(a.Sickle<0){
                a.Sickle++;
                a.Galleon--;
            }
        }
        z=a.Knut-b.Knut;
        if(a.Sickle-b.Sickle<0){
            a.Sickle+=17;
            a.Galleon--;
        }
        y=a.Sickle-b.Sickle;
        x=-(a.Galleon-b.Galleon);
    }
    printf("%d.%d.%d",x,y,z);
    return 0;
}


/*
标准答案
int main()
{
    long int g1, g2, s1, s2, k1, k2;
    scanf("%ld.%ld.%ld %ld.%ld.%ld", &g1, &s1, &k1, &g2, &s2, &k2);
    k1 = g1 * 17 * 29 + s1 * 29 + k1;
    k2 = g2 * 17 * 29 + s2 * 29 + k2;
    long int sub;
    sub = k2 - k1;
    if(sub < 0)
    {
        sub = -sub;
        printf("-");
    }
    int g, s, k;
    g = sub / (17*29);
    s = sub % (17*29) / 29;
    k = sub % (17*29) % 29;
    printf("%d.%d.%d", g, s, k);
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1058
int main()
{
	long long  a,b,c,a2,b2,c2;
	scanf("%lld.%lld.%lld %lld.%lld.%lld",&a,&b,&c,&a2,&b2,&c2);
	long long sum = a*29*17 + b*29 + c + a2*29*17 + b2*29 + c2;
	printf("%lld.%lld.%lld\n",sum/(29*17),sum%(17*29)/29,sum%(17*29)%29);
    return 0;
}

/*
//PAT A1027
char color[14]={'0','1','2','3','4','5','6','7','8','9','A','B','C'};

int main()
{
    int Red,Green,Blue;
    scanf("%d%d%d",&Red,&Green,&Blue);
    printf("#");
    printf("%c%c",color[Red/13],color[Red%13]);
    printf("%c%c",color[Green/13],color[Green%13]);
    printf("%c%c",color[Blue/13],color[Blue%13]);
    return 0;
}
*/

/*
//PAT A1019
bool judge(int x[],int num){
    for(int i=0;i<=num/2;i++){
        if(x[i]!=x[num-1-i])
            return false;
    }
    return true;
}

int main()
{
    int N,b;
    scanf("%d%d",&N,&b);
    int x[100];
    int num=0;
    do{
        x[num++]=N%b;
        N/=b;
    }while(N!=0);
    bool flag=judge(x,num);
    if(flag) printf("Yes\n");
    else printf("No\n");
    for(int i=num-1;i>=0;i--){
        printf("%d",x[i]);
        if(i!=0) printf(" ");
    }
    return 0;
}
*/

3.6

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1061
char* change[7]={"MON", "TUE" , "WED" , "THU" , "FRI" , "SAT" , "SUN"};

int main()
{
    char str1[65];
    char str2[65];
    char str3[65];
    char str4[65];
    scanf("%s%s%s%s",str1,str2,str3,str4);
    int i;
    //printf("%s\n%s\n\n",str3,str4);
    for(i=0;i<strlen(str1)&&i<strlen(str2);i++){
        if(str1[i]==str2[i]&&str1[i]>='A'&&str1[i]<='G'){
            printf("%s ",change[str1[i]-'A']);
            break;
        }
    }
    i++;
    for(;i<strlen(str1)&&i<strlen(str2);i++){
        if(str1[i]==str2[i]){
            if(str1[i]>='0'&&str1[i]<='9'){
                printf("%02d:",str1[i]-'0');
                break;
            }
            else if(str1[i]>='A'&&str1[i]<='N'){
                printf("%02d:",str1[i]-'A'+10);
                break;
            }
        }
    }
    for(i=0;i<strlen(str3)&&i<strlen(str4);i++){
        if(str3[i]==str4[i]){
            if((str3[i]>='A'&&str3[i]<='Z') || (str3[i]>='a'&&str3[i]<='z')){
                printf("%02d",i);
                break;
            }
        }
    }
    return 0;
}

/*
//PAT B1002
char* change[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};

int main()
{
    char str[101];
    scanf("%s",str);
    int n=strlen(str);
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=(str[i]-'0');
    }
    int x=sum/100;
    int y=sum%100/10;
    int z=sum%100%10;
    if(x){
        for(int i=1;i<10;i++){
            if(x==i)
                printf("%s ",change[i]);
        }
        for(int i=0;i<10;i++){
            if(y==i)
                printf("%s ",change[i]);
        }
        for(int i=0;i<10;i++){
            if(z==i)
                printf("%s",change[i]);
        }
    }
    else{
        if(y){
            for(int i=1;i<10;i++){
                if(y==i)
                    printf("%s ",change[i]);
            }
            for(int i=0;i<10;i++){
                if(z==i)
                    printf("%s",change[i]);
            }
        }
        else{
            for(int i=0;i<10;i++){
                if(z==i)
                    printf("%s",change[i]);
            }
        }
    }
    return 0;
}
*/

/*
//PAT B1031
struct temp{
    char s[18];
    int flag=0;
};

char check[11]={'1','0','X','9','8','7','6','5','4','3','2'};

int main()
{
    int N;
    scanf("%d",&N);
    int invalid=0;
    temp str[N];
    for(int i=0;i<N;i++){
        scanf("%s",str[i].s);
        int x=((int)str[i].s[0]-'0')*7+((int)str[i].s[1]-'0')*9+((int)str[i].s[2]-'0')*10+
        ((int)str[i].s[3]-'0')*5+((int)str[i].s[4]-'0')*8+((int)str[i].s[5]-'0')*4+
        ((int)str[i].s[6]-'0')*2+((int)str[i].s[7]-'0')*1+((int)str[i].s[8]-'0')*6+
        ((int)str[i].s[9]-'0')*3+((int)str[i].s[10]-'0')*7+((int)str[i].s[11]-'0')*9+
        ((int)str[i].s[12]-'0')*10+((int)str[i].s[13]-'0')*5+((int)str[i].s[14]-'0')*8+
        ((int)str[i].s[15]-'0')*4+((int)str[i].s[16]-'0')*2;
        x%=11;
        char y=check[x];
        if(y!=str[i].s[17]){
            invalid++;
            str[i].flag=1;
        }
    }
    if(invalid==0) printf("All passed");
    else{
        for(int i=0;i<N;i++)
            if(str[i].flag==1)
                printf("%s\n",str[i].s);
    }
    //system("pause");
    return 0;
}
*/

/*
//PAT B1021
int main()
{
    char N[1001];
    int a[10]={0};
    cin.getline(N,1001);
    int n=strlen(N);
    for(int i=0;i<n;i++){
        a[int(N[i])-48]++;
    }
    for(int i=0;i<10;i++){
        if(a[i]!=0)
            printf("%d:%d\n",i,a[i]);
    }
    return 0;
}
*/

/*
//PAT B1006
int main()
{
    int N;
    scanf("%d",&N);
    int b=N/100;
    int s=N%100/10;
    int m=N%100%10;
    for(int i=0;i<b;i++)
        printf("B");
    for(int i=0;i<s;i++)
        printf("S");
    for(int i=1;i<=m;i++)
        printf("%d",i);
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>

using namespace std;

//PAT A1073
int main()
{
    char str[10001];
    scanf("%s",str);
    int len=strlen(str);
    if(str[0]=='-')
        printf("-");
    int pos=0; //to find E
    while(str[pos]!='E')
        pos++;
    int exp=0;
    for(int i=pos+2;i<len;i++)
        exp=exp*10+str[i]-'0';
    if(exp==0){
        for(int i=1;i<pos;i++)
            printf("%c",str[i]);
    }
    if(str[pos+1]=='-'){
        printf("0.");
        for(int i=0;i<exp-1;i++)
            printf("0");
        printf("%c",str[1]);
        for(int i=3;i<pos;i++)
            printf("%c",str[i]);
    }
    else{
        for(int i=1;i<pos;i++){
            if(str[i]=='.') continue;
            printf("%c",str[i]);
            if(pos-3!=exp&&i==exp+2)
                printf(".");
        }
        for(int i=0;i<exp-(pos-3);i++)
            printf("0");
    }
    return 0;
}

/*
//PAT B1048
char change[13]={'0','1','2','3','4','5','6','7','8','9','J','Q','K'};
void reverse(char str[])
{
    int len=strlen(str);
    for(int i=0;i<len/2;i++){
        char temp=str[i];
        str[i]=str[len-1-i];
        str[len-1-i]=temp;
    }
}

int main()
{
    char A[101],B[101],ans[101]={0};
    scanf("%s%s",A,B);
    reverse(A);
    reverse(B);
    char temp;
    int i;
    for(i=0;i<max(strlen(A),strlen(B));i++){
        int numa=i<strlen(A)?A[i]-'0':0;
        int numb=i<strlen(B)?B[i]-'0':0;
        if(i%2==0){
            temp=change[(numa+numb)%13];
            ans[i]=temp;
        }
        else{
            int temp=numb-numa;
            if(temp<0)
                temp+=10;
            ans[i]=temp+'0';
        }
    }
    reverse(ans);
    printf("%s",ans);
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <string.h>
#include <algorithm>

using namespace std;

//PAT A1077
int main()
{
    int N;
    int flag=0;
    scanf("%d\n",&N);
    string str;
    string temp;
    //temp.resize(260);
    //getchar();
    getline(cin,temp);
    reverse(temp.begin(),temp.end());
    //cout<<temp<<endl;
    for(int i=1;i<N;i++){
        //getchar();
        //str.resize(260);
        getline(cin,str);
        reverse(str.begin(),str.end());
        for(int j=0;j<temp.length()&&j<str.length();j++){
            if(temp[j]!=str[j]){
                if(j==0){
                    printf("nai");
                    return 0;
                }
                else{
                        temp= temp.substr(0, j);
                        break;
                }
            }
        }
    }
    reverse(temp.begin(),temp.end());
    cout<<temp<<endl;
    //system("pause");
    return 0;
}

/*
//PAT A1035
struct node{
    char name[11];
    char pwd[11];
    int flag=0;
};

int main()
{
    int N;
    scanf("%d",&N);
    node student[N];
    int count=0;
    for(int i=0;i<N;i++){
        scanf("%s %s",student[i].name,student[i].pwd);
        for(int j=0;j<strlen(student[i].pwd);j++){
            if(student[i].pwd[j]=='1'){
                student[i].flag=1;
                student[i].pwd[j]='@';
            }
            else if(student[i].pwd[j]=='0'){
                student[i].flag=1;
                student[i].pwd[j]='%';
            }
            else if(student[i].pwd[j]=='l'){
                student[i].flag=1;
                student[i].pwd[j]='L';
            }
            else if(student[i].pwd[j]=='O'){
                student[i].flag=1;
                student[i].pwd[j]='o';
            }
        }
        if(student[i].flag==1)
            count++;
    }
    if(count==0&&N==1)
        printf("There is 1 account and no account is modified",N);
    else if(count==0&&N!=1)
        printf("There are %d accounts and no account is modified",N);
    else{
        printf("%d\n",count);
        for(int i=0;i<N;i++){
            if(student[i].flag==1)
                printf("%s %s\n",student[i].name,student[i].pwd);
        }
    }
    return 0;
}
*/

/*
//PAT A1005
char* change[10]={"zero","one","two","three","four","five","six","seven","eight","nine"};

int  main()
{
    char str[101];
    char* ans[101];
    scanf("%s",str);
    int len=strlen(str);
    int sum=0;
    for(int i=0;i<len;i++){
        sum+=str[i]-'0';
    }
    //printf("%d",sum);
    if(sum==0){
        printf("zero");
        return 0;
    }
    int i;
    for(i=0;sum!=0;i++){
        ans[i]=change[sum%10];
        sum/=10;
    }
    i--;
    for(;i>0;i--)
        printf("%s ",ans[i]);
    printf("%s",ans[0]);
    return 0;
}
*/

/*
//PAT A1001
int main()
{
    int a,b;
    scanf("%d%d",&a,&b);
    int c=a+b;
    if(c<0){
        printf("-");
        c=-c;
    }
    string s=to_string(c);
    reverse(s.begin(),s.end());
    int len=s.length();
    for(int i=len-1;i>=0;i--){
        if((i+1)%3==0&&i!=len-1){
            printf(",");
        }
        printf("%c",s[i]);
    }
    return 0;
}
*/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <string.h>
#include <algorithm>

using namespace std;
char* sat[5]={"Shi","Bai","Qian","Wan","Yi"};
char* num[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};

int main()
{
    char str[12];
    scanf("%s",str);
    int len=strlen(str);
    int left=0;
    int right=len-1;
    if(str[0]=='-'){
        printf("Fu");
        left++;
    }
    while(left<=right)
        right-=4;
    while(left<len){
        bool flag=false;
        bool isPrint=false;
        while(left<=right){
            if(left>0&&str[left]=='0')
                flag=true;
            else{
                if(flag==true){
                    printf(" ling");
                    flag=false;
                }
                if(left>0)
                    printf(" ");
                printf("%s",num[str[left]-'0']);
                isPrint=true;
                if(left!=right)
                    printf(" %s",sat[right-left-1]);
            }
        left++;
        }
        if(isPrint==true&&right!=len-1){
            printf(" %s",sat[(len-1-right)/4+2]);
        }
        right+=4;
    }
    return 0;
}

本文作者： xiaoyuyu
本文链接： http://woaixiaoyuyu.github.io/2020/01/12/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0-%E7%AC%AC%E4%B8%89%E7%AB%A0/
版权声明： 本作品采用 知识共享署名-非商业性使用-相同方式共享 4.0 国际许可协议 进行许可。转载请注明出处！
赏

谢谢你请我吃糖果

扫一扫，分享到微信

微信分享二维码
本站总访问量次 本站访客数人

tag:

    缺失模块。
    1、请确保node版本大于6.2
    2、在博客根目录（注意不是yilia根目录）执行以下命令：
    npm i hexo-generator-json-content --save

    3、在根目录_config.yml里添加配置： 

      jsonContent:
    meta: false
    pages: false
    posts:
      title: true
      date: true
      path: true
      text: false
      raw: false
      content: false
      slug: false
      updated: false
      comments: false
      link: false
      permalink: false
      excerpt: false
      categories: false
      tags: true

记录成长的点滴<br><br>涉猎颇广的信息技术爱好者<br>希望未来的xiaoyuyu<br>可以成为优秀的工程师