求n以內最大的k個素數以及它們的和
阿新 • • 發佈:2019-01-10
import java.util.Scanner;
public class sushu {public static void main(String[] args) {
Scanner scanf =new Scanner(System.in);
int n,k=0,m,sum=0,i,j;
n=scanf.nextInt();
m=scanf.nextInt();
for(i=n;i>1;i--) {
for(j=2;j<Math.sqrt(i);j++) {
if(i%j==0) break;
}
if(j>Math.sqrt(i))
{ k++;
if(k!=m)
System.out.print(i+"+");
else
System.out.print(i);
sum+=i;
}
if(k==m)
break;
}
System.out.print("="+sum);
}
}