PAT(乙级)1008.数组元素循环右移问题1009.说反话1010.一元多项式求导1011.A+B和C1012.数字分类1013.数素数

 

1008.数组元素循环右移问题

AC代码：

import java.util.Scanner;
public class Main {

  public static void main(String[] args) {
    Scanner in=new Scanner(System.in);
    int N=in.nextInt();
    int M=in.nextInt();
    int num[]=new int[N];
    for(int i=0;i<N;i++) {
      num[i]=in.nextInt();
    }
    M%=N;
    for(int i=N-M;i<N;i++) {
      System.out.print(num[i]+" ");
    }
    for(int j=0;j<N-M;j++) {
      System.out.print(num[j]);
      if(j<N-M-1) {
        System.out.print(" ");
      }
    }
  }
}

 

1009.说反话

AC代码：

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		String words=in.nextLine();
		String word[]=words.split(" ");
		for(int i=word.length-1;i>=0;i--) {
			System.out.print(word[i]);
			if(i!=0) {
				System.out.print(" ");
			}
		}
	}
}

 

1010.一元多项式求导

题目有坑 

 

 

1011.A+B和C

注意：题中在运算过程中会超int型范围 要使用long型

import java.util.Scanner;
public class Main{
 public static void main(String[] args) {
  Scanner in=new Scanner(System.in);
  int T=in.nextInt();
  long A[]=new long[T];
  long B[]=new long[T];
  long C[]=new long[T];
  for(int i=0;i<T;i++) {
   A[i]=in.nextInt();
   B[i]=in.nextInt();
   C[i]=in.nextInt();
  }
  for(int i=0;i<T;i++) {
   boolean flag=(A[i]+B[i])>C[i];
   System.out.println("Case #"+(i+1)+": "+flag);
  }
 }
}

 

1012.数字分类

PAT上限时100ms  java有几个测试点会超时

import java.text.DecimalFormat;
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int sum1=0;
		int sum2=0;
		int sum3=0;
		int sum4=0;
		double avg=0;
		int max=0;
		int N=in.nextInt();
		int j=-1;
		for(int i=0;i<N;i++) {
			int num=in.nextInt();
			int mod=num%5;
			switch (mod) {
			case 0:
				if(num%2==0)sum1+=num; 
				break;
			case 1:
				j*=-1;
				sum2+=j*num; 
				break;
			case 2:
				sum3++; 
				break;
			case 3:
				sum4++;
				avg+=num;
				break;
			case 4:
				if(max<num)max=num; 
				break;
			}
		}
		avg/=sum4;
		DecimalFormat df=new DecimalFormat(".0");
		if(sum1!=0) {
			System.out.print(sum1+" ");
		} else {
			System.out.print("N ");
		}
		if(sum2!=0) {
			System.out.print(sum2+" ");
		} else {
			System.out.print("N ");
		}
		if(sum3!=0) {
			System.out.print(sum3+" ");
		} else {
			System.out.print("N ");
		}
		if(avg!=0) {
			System.out.print(df.format(avg)+" ");
		} else {
			System.out.print("N ");
		}
		if(max!=0) {
			System.out.print(max);
		} else {
			System.out.print("N");
		}
	}
}

1013.数素数

import java.util.Scanner;
public class Main {

  public static void main(String[] args) {
    Scanner in=new Scanner(System.in);
    int M=in.nextInt();
    int N=in.nextInt();
    int sum=0;
    int n=0;
    boolean f=false;
    for(int i=2;;i++) {
      if(sum>N)break;
      int j=2;
      for(;j<=Math.sqrt(i);j++) {
        if(i%j==0) {
          break;
        }
      }
      if(j>Math.sqrt(i)) {
        sum++;
        f=true;
      }
      if(sum>=M && sum<N && f) {
        n++;
        if(n%10==0) {
          System.out.println(i);
        } else {
          System.out.print(i+" ");
        }
      }else if(sum==N && f) {
        System.out.print(i);
      }
      f=false;
    }
  }
}