- 土拨鼠素数
- 代码
- @ 2023-10-15 17:19:31
#include<bits/stdc++.h>
using namespace std;
int isprime(int x){
	if(x <= 1) return 0;
	for(int i = 2; i <= sqrt(x); i++)
		if(x % i == 0) return 0;
	return 1;
}
int main(){
	int n,a,sum=0;
	cin>>n;
	for(int j=1;j<=n;j++){
		cin>>a;
		if(isprime(a)){
			sum+=a;
		}
	}
	if(sum==0){
		cout<<"sad";
	}
	else{
		cout<<sum;
	}
	return 0;
}
0 comments
  
  No comments so far...
            Information
- ID
- 476
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 9
- Tags
- (None)
- # Submissions
- 12
- Accepted
- 4
- Uploaded By
 
       
    