Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- int isSoNT(int n){
- if(n < 2) return 0;
- for(int i = 2; i <= sqrt(n); i++){
- if(n%i == 0) return 0;
- }
- return 1;
- }
- int xuLi(int a[100][100], int n){
- int b[100];
- int sum = 0;
- for(int i = 0; i < n; i++){
- for(int j = 0; j < n; j++){
- if(j<=i){
- if(isSoNT(a[i][j])){
- sum+= a[i][j];
- }
- }
- }
- }
- return sum;
- }
- main(){
- int a[100][100];
- int n; scanf("%d", &n);
- for(int i = 0; i < n; i++){
- for(int j = 0; j < n; j++){
- scanf("%d", &a[i][j]);
- }
- }
- printf("%d", xuLi(a, n));
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement