@[Andrews123](/user/552018) 建议写个判断质数的函数
by Dream_Creator @ 2024-04-05 11:22:14
cout<<i;
改为
cout<<i<<endl;
还有，要写单独素数函数
```cpp
bool is_prime(int n){
if(n%2==0){
return 0;
}
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return 0;
}
}
return 1;
}
```
by yangtaixuan @ 2024-04-05 11:25:05
@[Andrews123](/user/552018)
by yangtaixuan @ 2024-04-05 11:25:58
@[yangtaixuan](/user/1125478) 修改成这样了，现在0分了……
```cpp
#include <iostream>
#include <cmath>
using namespace std;
bool is_prime(int n){
if(n%2==0){
return 0;
}
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return 0;
}
}
return 1;
}
int main(){
int ans,n,a;
cin>>n;
for(int i=2;i<=n;i++){
if(is_prime(i)){
ans+=i;
if(ans>n){
break;
}
cout<<i<<endl;
a++;
}
}
cout<<a;
return 0;
}
```
by Andrews123 @ 2024-04-05 11:28:22
```cpp
bool is_prime(int n){
if(n%2==0 && n!=2){
return 0;
}
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return 0;
}
}
return 1;
}
```
by yangtaixuan @ 2024-04-05 11:33:42
@[Andrews123](/user/552018) 你再看看吧
by yangtaixuan @ 2024-04-05 11:34:41