其他题解收录都在这了👇👇👇
目录
1006、换个格式输出整数(分数 15)
题目描述:
代码实现:
n = input()
nls = list(map(int, list(n)))
if len(nls) == 3:
print(nls[0] * 'B',end='')
print(nls[1] * 'S', end='')
for i in range(1,nls[2] + 1):
print(i, end='')
print()
elif len(nls) == 2:
print(nls[0] * 'S', end='')
for i in range(1,nls[1] + 1):
print(i, end='')
print()
elif len(nls) == 1:
for i in range(1,nls[0] + 1):
print(i, end='')
print()
结果:
1007、素数对猜想(分数 20)
题目描述:
代码实现:
import java.util.*;
public class Main{
public static boolean isprime(int n){
if(n == 2 || n == 3) return true;
for(int i = 2;i <= Math.sqrt(n);i ++){
if(n % i == 0)
return false;
}
return true;
}
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int count = 0;
int i = 2;
while(i <= N - 2){
if(isprime(i) && isprime(i + 2)){
count ++;
i += 2;
}
else i++;
}
System.out.println(count);
}
}
结果:
1008、数组元素循环右移问题(分数 20)
题目描述:
代码实现:
import java.util.*;
public class Main{
public static void ArrayReverse(int[] arr, int begin, int end){
//数组反转
while(begin < end){
int temp = arr[begin];
arr[begin] = arr[end];
arr[end] = temp;
begin ++;
end --;
}
}
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int M = in.nextInt();
int[] A = new int[N];
for(int i = 0;i < N;i ++) A[i] = in.nextInt();
in.close();
M = M % N;
ArrayReverse(A, 0, A.length - M - 1); //左反转
ArrayReverse(A, A.length - M, A.length - 1); //右反转
ArrayReverse(A, 0, A.length - 1); //总反转
for(int i = 0;i < A.length - 1;i ++){
System.out.print(A[i] + " ");
}
System.out.println(A[A.length - 1]);
}
}
结果:
1009、说反话(分数 20)
题目描述:
代码实现:
exp = input()
words = exp.split(" ")
words.reverse()
for i in range(len(words)):
if i == len(words) - 1:
print(words[i])
else:
print(words[i], end=' ')
结果:
1010、一元多项式求导(分数 25)
题目描述:
代码实现:
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
String input = in.nextLine();
String[] nums = input.split("\\s+");
StringBuffer res = new StringBuffer();
for(int i = 0;i < nums.length;i += 2){
int num1 = Integer.parseInt(nums[i]);
int num2 = Integer.parseInt(nums[i + 1]);
if(num2 == 0 && num1 != 0) continue; //系数不为零,指数为零
else if(num1 == 0){ //零多项式
res.append("0 0 ");
continue;
}
//正常求
res.append(num1 * num2 + " " + (num2 - 1) + " ");
}
if (res.length() == 0) System.out.println("0 0");
else System.out.printf(res.substring(0,res.length() - 1));
}
}
结果: