PAT-B-1011~1015试题代码（Java）

发表于   |   分类于   |  

1011. A+B和C (15)

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
package com.hym.PAT_B;

import java.util.Scanner;

/**
 * Created by ymhou on 2016/11/21.
 * 通过全部测试点，答案正确
 */
public class PAT_B_1011 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        long num[][] = new long[T][3];

        for(int i=0; i<T; i++){
            for(int j=0; j<3; j++){
                num[i][j] = scanner.nextInt();
            }
        }

        for(int i=0; i<T; i++){
            int n = i+1;
            if(num[i][0]+num[i][1] > num[i][2]){
                System.out.println("Case #"+n+": true");
            }
            else {
                System.out.println("Case #"+n+": false");
            }
        }
    }
}

1012. 数字分类 (20)

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
package com.hym.PAT_B;

import java.util.Scanner;

/**
 * Created by ymhou on 2016/11/21.
 * PAT官网运行超时（100ms运行时间限制），牛客网运行通过
 */
public class PAT_B_1012 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int num[] = new int[N];
        for(int i=0; i<N; i++){
            num[i] = scanner.nextInt();
        }

        int A1=0,A2=0,A3=0,A5=0,S4=0;
        double A4;
        int countA4=0, count=0;
        for(int i=0; i<N; i++){
            int remainder = num[i]%5;
            if(remainder==0 && num[i]%2==0){
                A1 = A1 + num[i];
            }
            if(remainder==1){
                if(count%2==0){
                    A2 = A2 + num[i];
                }else {
                    A2 = A2 - num[i];
                }
                count++;
            }
            if(remainder==2){
                A3++;
            }
            if(remainder==3){
                S4 = S4 + num[i];
                countA4++;
            }
            if(remainder==4){
                if(A5<num[i]){
                    A5=num[i];
                }
            }
        }


        if(A1==0){
            System.out.print("N ");
        }else {
            System.out.print(A1+" ");
        }
        if(A2==0){
            System.out.print("N ");
        }else {
            System.out.print(A2+" ");
        }
        if(A3==0){
            System.out.print("N ");
        }else {
            System.out.print(A3+" ");
        }
        if(S4==0){
            System.out.print("N ");
        }else {
            A4 = 1.0*S4/countA4;
            Math.round(A4);
            System.out.print(String.format("%.1f",A4)+" ");
        }
        if(A5==0){
            System.out.print("N");
        }else {
            System.out.print(A5);
        }


    }
}

1013. 数素数 (20)

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
package com.hym.PAT_B;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * Created by ymhou on 2016/11/22.
 * PAT官网部分测试点运行超时（100ms运行时间限制），牛客网运行通过
 */
public class PAT_B_1013 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int M = scanner.nextInt();
        int N = scanner.nextInt();
        List<Integer> list;
        list = GetnPrimeList(N);
        for(int i=M-1; i<N; i++){
            System.out.print(list.get(i));
            if((i-M+2)%10 !=0){
                if(i==N-1) break;
                System.out.print(" ");
            }else {
                System.out.println();
            }
        }
    }

    public static List<Integer> GetnPrimeList(int num){
        List<Integer> list = new ArrayList<Integer>();
        int startNumber = 1;
        while(list.size() < num){
            if(IsPrime(startNumber,list)){
                list.add(startNumber);
            }
            startNumber++;
        }
        return list;
    }

    public static boolean IsPrime(int num,List<Integer> list){
        if(num==1){
            return false;
        }
        int max = (int) Math.sqrt(num);
        for(int n:list){
            if(num%n==0){
                return false;
            }
            if(n>max){
                break;
            }
        }
        return true;
    }
}

1014. 福尔摩斯的约会 (20)

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
package com.hym.PAT_B;

import java.util.Scanner;

/**
 * Created by ymhou on 2016/11/22.
 * PAT官网运行超时（100ms运行时间限制），牛客网运行通过
 */
public class PAT_B_1014 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String inputString[] = new String[4];
        for(int i=0; i<4; i++){
            inputString[i] = scanner.next();
        }

        int stringSize1,stringSize2;
        if(inputString[0].length() >= inputString[1].length()){
            stringSize1 = inputString[1].length();
        }else {
            stringSize1 = inputString[0].length();
        }
        if(inputString[2].length() >= inputString[3].length()){
            stringSize2 = inputString[3].length();
        }else {
            stringSize2 = inputString[2].length();
        }

        int Dayindex=0,Hourindex=0,minuteindex=0,flag=0;
        for(int i=0; i<stringSize1; i++){
            if(inputString[0].charAt(i) == inputString[1].charAt(i)){
                if(flag==0 && inputString[0].charAt(i)>='A' && inputString[0].charAt(i)<='G'){
                    Dayindex = i;
                    flag++;
                    continue;
                }
                if(flag!=0 && ((inputString[0].charAt(i)>='A' && inputString[0].charAt(i)<='N') || (inputString[0].charAt(i)>='0' && inputString[0].charAt(i)<='9'))){
                    Hourindex = i;
                    break;
                }

            }
        }

        for(int i=0; i<stringSize2; i++){
            if(inputString[2].charAt(i) == inputString[3].charAt(i) && ((inputString[2].charAt(i)>='A' && inputString[2].charAt(i)<='Z')||(inputString[2].charAt(i)>='a' && inputString[2].charAt(i)<='z'))){
                minuteindex = i;
                break;
            }
        }

        String dayArray[] = {"MON","TUE","WED","THU","FRI","SAT","SUN"};
        System.out.print(dayArray[(int)inputString[0].charAt(Dayindex)-65]+" ");
        char hour = inputString[0].charAt(Hourindex);
        if(hour>57){
            System.out.print(String.format("%02d",(int) hour-55));
        }else {
            System.out.print(String.format("%02d",(int) hour-48));
        }
        System.out.print(":"+String.format("%02d",minuteindex));

    }
}

1015. 德才论 (25)

坚持原创技术分享，您的支持将鼓励我继续创作！