一道简单的oj题做做额嗯

#include <stdio.h>

    int main () {
    int n;
    scanf("%d",&n);
    char a[n];
    char b[n];
    int i,j,k,sum;
    int flag = 1;
    for(i=0;i<n;i++) {
        scanf("%d",a[i]);
    }
    for(i=0;i<n;i++) {
        for(j=1;j<a[i];j++) {
            if(a[i] % j == 0) {
                flag = 0;
                break;
            }
        }
        if(flag) {
            sum += a[i];
        }
        b[i] = sum;
        sum = 0;
    }
    for(k=0;k<sizeof(b);k++) {
        printf("%d\n",b[k]);
    }
    
    return 0;
}

#include <stdio.h>
int main() {
    int n,a,i,j,k,f,s;
    scanf("%d",&n);
    for(i=1; i<=n; i++) {
        scanf("%d",&a);
        s=0;
        for(j=2; j<=a; j++) {
            f=1;
            for(k=2; k*k<=j; k++) {
                if(j%k==0) {
                    f=0;
                    break;
                }
            }
            if(f) {
                s+=j;
            }
        }
        printf("%d\n",s);
    }
    return 0;
}

 觉得有用的话采纳一下哈

参考 #includeint main(){ int n,i,j,t,l; int sum=0; printf("请输入一个大于2的整数："); scanf("%d",&n); l=n; for(;n>=2;n--) { for(i=2;i https://blog.csdn.net/TX17_38381517124/article/details/78755324?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522163600732116780357297444%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=163600732116780357297444&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_v2~rank_v29-10-78755324.pc_v2_rank_blog_default&utm_term=1-n%E4%B9%8B%E9%97%B4%E6%89%80%E4%BB%A5%E7%B4%A0%E6%95%B0%E4%B9%8B%E5%92%8C&spm=1018.2226.3001.4450

N=int(input(''))
num=[]
for i in range(N):
    num.append(int(input()))
for item in num:
    if item<=1:
        print(0)
    else:
        res=0
        for iitem in range(2,item+1):
            for i in range(2,iitem):
                if (iitem % i) == 0:
                    break
            else:
                res+=iitem
        print(res)

#include<iostream>
#include<math.h>
using namespace std;
bool isPrimeNumber(int n) {
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i==0)
            return false;
    }
    return true;
}
int main() {
    int a[1000];
    int sum=0,nTest,index;
    for (int i = 2; i < 1000; i++) {
        if (isPrimeNumber(i))
            sum += i;
        a[i] = sum;
    }
    cin >> nTest;
    while (nTest--) {
        cin >> index;
        cout << a[index] << endl;
    }
}