Comments

• 
  

  0

  

  Nguyen0907  commented on Aug. 8, 2025, 7:11 p.m. ← edit 2 →

  include <bits/stdc++.h>

  using namespace std;
  
  #define fastIO() ios::sync_with_stdio(false); cin.tie(nullptr);
  #define ll long long
  
  int isPrime(int n) {
      if(n < 2) return false;
      for(int i = 2; i <= sqrt(n); i++) {
          if(n % i == 0) {
              return false;
          }
      }
      return true;
  }
  
  int main() {
      fastIO();
  
      int n; cin >> n;
      int a[n];
  
      for(int i = 0; i < n; i++){
          cin >> a[i];
      }
  
      int tong = 0;
      int count = 0;
      for(int i = 0; i < n; i++) {
          if(isPrime(a[i])) {
              tong += a[i];
              count += 1;
          }
      }
      cout<< fixed << setprecision(3) << tong/(double)count << endl;
  
      return 0;
  }
  

• 
  

  0

  

  hngoc  commented on July 6, 2025, 10:53 a.m.

  import math
  def nt(n):
      if n<2:return False
      for i in range(2,math.floor(math.sqrt(n))+1):
          if n%i==0:return False
      return True
  
  n=input()
  tmp=input().split()
  a=[int(i) for i in tmp]
  cnt=0
  s=0
  for x in a:
      if nt(x):
          s+=x
          cnt+=1
  
  ans=s/cnt
  print(f'{ans:.3f}')
  

• 
  

  0

  

  hngoc  commented on July 4, 2025, 1:58 p.m.

  import math
  def nt(n):
      if n<=1:return False
      if n==2 or n==3:return True
      if n%2==0 or n%3==0:return False
      for i in range(5,math.floor(math.sqrt(n))+1,6):
          if n%i==0 or n%(i+2)==0:return False
      return True
  
  n=input()
  tmp=input().split()
  a=[int(i) for i in tmp]
  cnt=0
  s=0
  for x in a:
      if nt(x):
          s+=x
          cnt+=1
  
  ans=s/cnt
  print(f'{ans:.3f}')
  

• 
  

  -8

  

  heo2912013  commented on Feb. 22, 2025, 6:24 a.m.

  THAM KHẢO CÁCH LÀM DỄ HIỂU CỦA C++

  include <bits/stdc++.h>

  using namespace std; int n; bool nt(int n) { if(n<2) return false; for(int i=2;i<=sqrt(n);i++){ if(n%i==0){ return false; } } return true; } int cnt=0,sum=0,N; int main(){ cin>>N; int A[N]; for(int i=1;i<=N;i++){ cin>>A[i]; } for(int i=1;i<=N;i++){ if(i<n-1&&A[i]==A[i+1]){ A[i]=0; } if(nt(A[i])==true){ cnt++; sum+=A[i]; } } cout<<fixed<

  This comment is hidden due to too much negative feedback. Show it anyway.