PAT乙级源码

更新中。。。。。。

1001.3n+1猜想

​
import java.util.*;
public class Main
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		int Nums = 0;
		int n = in.nextInt();
		if(n<=1000&&n>0)
		{
			while(n!=1){
				  Nums++;
				  if(n%2==0) n=n/2;
				  else n=(n*3+1)/2;
				}
		}
		System.out.println(Nums);
	}
}

​

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

import java.util.*;
public class Main{
  public static void main(String[] args){
	Scanner in = new Scanner(System.in);
	int N = 0;
	int M = -1;
	String s = "";
	while(M<0||N<1||N>100){
		s = in.nextLine();
		String[] str = s.split(" ");
		N = Integer.parseInt(str[0]);
		M = Integer.parseInt(str[1]);
	}
	s = in.nextLine();
	String[] str = s.split(" ");
	int[] Nums = new int[N];
	for(int i=0;i<N;i++)
	{
		if((M+i)<N) Nums[i+M] = Integer.parseInt(str[i]);
		else Nums[(M+i)%N] = Integer.parseInt(str[i]);
	}
	
	for(int i = 0;i<N;i++)
	{
		System.out.print(Nums[i]);
		if(i<N-1) System.out.print(" ");
	}
  }
}

1009:说反话

import java.util.*;
public class Main{
  public static void main(String[] args){
	Scanner in = new Scanner(System.in);
	String s = in.nextLine();
	String str = "";
	Vector v = new Vector();
	char[] charr = s.toCharArray();
	for(int i = 0;i<s.length();i++)
	{
		if(charr[i]!=' ') str = str + charr[i];
		else{
			v.add(str);
			str = "";
		}
		if(i==(s.length()-1)) v.addElement(str);
	}
	for(int i = 0;i<v.size();i++)
	{
		String strr = (String) v.get(v.size() - 1 -i);
		System.out.print(strr);
		if(i!=v.size()-1) System.out.print(" ");
	}	
  }
}

1011 A+B和C

import java.util.*;
public class Main{
  public static void main(String[] args){
	Scanner in = new Scanner(System.in);
	String s = in.nextLine();
	String[] arr = new String[3];
	String[] result = new String[Integer.parseInt(s)];
	int n = Integer.parseInt(s);
	for(int i = 0;i<n;i++)
	{
		s = in.nextLine();
		arr = s.split(" ");
		long A = Long.parseLong(arr[0]);
		long B = Long.parseLong(arr[1]);
		long C = Long.parseLong(arr[2]);
		if(A + B > C)
			result[i] = "Case #"+new Integer(i+1)+": true";
		else result[i] = "Case #"+new Integer(i+1)+": false";
	}

	for(int i = 0;i<result.length;i++)
			System.out.println(result[i]);
  }
}

1012 数字分类

import java.util.*;
public class Main{
  public static void main(String[] args){
	Scanner in = new Scanner(System.in);
	int n = in.nextInt();
	int[] re = {0,0,0,0,0};
	int[] t ={0,0,0,0,0};
	for(int i=0;i<n;i++){
		int s = in.nextInt();	
		if(s%5==0&&s%2==0) {
			re[0]+=s;
			t[0]++;
		}
		if(s%5==1) {
			if(t[1]%2==0)re[1]+=s;
			else re[1]-=s;
			t[1]++;
		}
		if(s%5==2) {
			re[2]++;
			t[2]++;
		}
		if(s%5==3) {
			re[3]+=s;
			t[3]++;
		}
		if(s%5==4&&s>re[4]) {
			re[4] = s; 
			t[4]++;
		}
	}
	for(int i = 0;i<re.length;i++){
		if(i==3){
			if(t[i]==0) {
				System.out.print("N ");
				continue;
			}
			java.text.DecimalFormat df1 = new java.text.DecimalFormat("#.0");
			double d = re[i];
			System.out.print(df1.format(d/t[i])+" ");}
		else {
			if(t[i]==0)System.out.print("N");
			else System.out.print(re[i]);
			if(i<re.length-1)System.out.print(" ");
		}
	}
  }
}

1013 数素数

import java.util.*;
public class Main{
  public static void main(String[] args){
	Scanner in = new Scanner(System.in);
	int M = in.nextInt();
	int N = in.nextInt();
	int nums = 0;
	for(int k=2;nums<=N;k++){
		if(Testnums(k)) {
			nums++;
			if(nums>=M&&nums<=N)
			{
				if(nums==N){
					System.out.print(k);
					break;
				}		
				if((nums - M+1)%10==0)System.out.println(k);//第十个换行
				else System.out.print(k+" ");//其余输出后加上一个空格			
				}
		}
	}
  }
  public static boolean Testnums(int n){
	  for(int i=2;i<=n/2;i++){
		  if(n%i==0) return false;
	  }
	  return true;
  }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值