牛客编程题(十三)

//https://www.nowcoder.com/practice/196534628ca6490ebce2e336b47b3607?tpId=37&&tqId=21229&rp=1&ru=/ta/huawei&qru=/ta/huawei/question-ranking

97

import java.util.Scanner;

public class Main1 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long number = sc.nextLong();
		for (int i = 2; i <= Math.sqrt(number); i++) {
			while (number % i == 0) {
				number /= i;
				System.out.print(i + " ");
			}

		}
		if(number>1) {
			System.out.println(number+" ");
		}

	}
}

//https://www.nowcoder.com/practice/49e772ab08994a96980f9618892e55b6?tpId=37

98

import java.math.BigDecimal;
import java.util.Scanner;

public class Main2 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str1 = sc.next();
		String str2 = sc.next();
		StringBuilder s1 = new StringBuilder();
		StringBuilder s2 = new StringBuilder();
		for (int i = 0; i < str1.length(); i++) {
			if (str1.charAt(i) <= '9' && str1.charAt(i) >= '0') {
				s1.append(str1.charAt(i));
			}
		}
		for (int i = 0; i < str2.length(); i++) {
			if (str2.charAt(i) <= '9' && str2.charAt(i) >= '0') {
				s2.append(str2.charAt(i));
			}
		}
		BigDecimal b = new BigDecimal(s1.toString());
		BigDecimal c = new BigDecimal(s2.toString());	
		System.out.println(b.longValue() + c.longValue());
	}
}

//https://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9?tpId=37&tags=&title=&diffculty=0&judgeStatus=0&rp=0

99

import java.util.Scanner;

public class Main3 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int number = sc.nextInt();
		
		for (int i = number / 2; i >= 2; i--) {
			if (isPrimer(i) && isPrimer(number - i)) {
				System.out.println(i);
				System.out.println(number - i);
				break;
			}
		}
	}

	public static boolean isPrimer(int number) {
		for (int i = 2; i < number; i++) {
			if (number % i == 0)
				return false;
		}
		return true;
	}
}

//https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tags=&title=&diffculty=0&judgeStatus=0&rp=1

100

public class Main4 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		System.out.println(FirstNotRepeatingChar(str));
	}
	 public static int FirstNotRepeatingChar(String str) {
		 int res = -1;
		 if(str==null||str.length()==0)
			 return res;
		 else {
				int[] count = new int[128];
				char[]c = str.toCharArray();
				for(int i=0;i<c.length;i++) {
					count[c[i]]++;
				}
				for(int i=0;i<count.length;i++) {
					if(count[c[i]]==1) {
						res = i;
						break;
					}
						
				}
				return res;
		 }
      }
}

//https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&&tqId=11197&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

101

import java.util.Scanner;

public class Main5 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();
		System.out.println(ReverseSentence(str));
	}

	public static String ReverseSentence(String str) {
		str.trim();
		String[]arr = str.split(" ");
		String str1 = "";
		for(int i=0;i<arr.length/2;i++) {
			String temp = arr[i];
			 arr[i]=arr[arr.length-i-1];
			 arr[arr.length-i-1]=temp;
		}
		for(int i=0;i<arr.length;i++) {
			if(i==arr.length-1)
				str1=str1.concat(arr[i]);
			else
			str1=str1.concat(arr[i]+" ");
			
		}
		
		return str1;

	}
}

//https://www.nowcoder.com/practice/3245215fffb84b7b81285493eae92ff0?tpId=37&&tqId=21226&rp=1&ru=/ta/huawei&qru=/ta/huawei/question-ranking

102

import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;

public class Main6 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int x = sc.nextInt();
			int[] arr = new int[x];
			for(int i=0;i<arr.length;i++) {
				arr[i]=sc.nextInt();
			}
			Arrays.sort(arr);
			for(int i=0;i<arr.length;i++) {
				if(i==0||arr[i]!=arr[i-1]) {
					System.out.println(arr[i]);
				}
			}
		}
	
		
	}

}

//https://www.nowcoder.com/practice/d9162298cb5a437aad722fccccaae8a7?tpId=37&tags=&title=&diffculty=0&judgeStatus=0&rp=1

103

import java.util.Arrays;
import java.util.Scanner;

public class Main7 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			String str = sc.nextLine();
			if (str.length() % 8 != 0)
				str = str + "00000000";
			while (str.length() >= 8) {
				System.out.println(str.substring(0, 8));
				str = str.substring(8);
			}
		}
	}
}

//https://www.nowcoder.com/practice/3ab09737afb645cc82c35d56a5ce802a?tpId=37&tags=&title=&diffculty=0&judgeStatus=0&rp=1

104

import java.util.Scanner;
public class Main8 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		double num = sc.nextDouble();
		System.out.println(Math.round(num));
	}

}
  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 4
    评论
评论 4
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值