求n以内最大的k个素数以及它们的和
/problem-sets/1333351579003957248/problems/1333568702254993409
#include<stdio.h>
int judge(int n);
int main(void)
{
int i,j,n,k,sum=0;
scanf("%d%d",&n,&k);
for(i=n,j=0;1<=i;i--){
if(judge(i))
{
sum+=i,j++;
if(j==k||i==2)printf("%d",i);
else printf("%d+",i);
//i==2用来处理不够的情况
if(j==k||i==2)
{
printf("=%d",sum);return 0;
}
}
}
return 0;
}
//判断素数
int judge(int n)
{
int i;
if(n==1)return 0;
if(n==2)return 1;
if(n%2==0)return 0;
for(i=3;i*i<=n;i+=2)
if(n%i==0)return 0;
return 1;
}