1 solutions

  • 0
    @ 2024-12-10 21:47:36

    C :

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

    C++ :

    #include<iostream>
    #include<stdio.h>
    #include<cmath>
    using namespace std;
    
    int isprime(int x)
    {
        for(int j=2; j<=sqrt(x); j++)
            if(x%j==0) return 0;
        return 1;
    }
    
    int main()
    {
        //freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
        long long i,j,m,n,sum,k;
        cin>>m;
        while(m--)
        {
            sum=0,k=0;
            cin>>n;
            int a[n];
            for(i=0; i<n; i++)
                cin>>a[i];
            for(i=0; i<n; i++)
            {
                if(a[i]==1)
                    continue;
                if(isprime(a[i])==1)
                {
                    if(k==1) cout<<' ';
                    cout<<a[i];
                    k=1;
                    sum+=a[i];
                }
            }
            cout<<endl<<sum<<endl;
        }
    }
    
    
    • 1

    Information

    ID
    495
    Time
    2000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By